We present a simple exact algorithm for the INDEPENDENT SET problem with a runtime bounded by O(1.2132npoly(n)). This bound is obtained by, firstly, applying a new branching rule and, secondly, by a distinct, computer-aided case analysis. The new branching rule uses the concept of satellites and has previously only been used in an algorithm for sparse graphs. The computer-aided case analysis al...

Benhabib and Farmer (1996) explore the possibility of local indeterminacy in a twosector model with sector-specific externalities. They find that very small sector-specific externalities are sufficient for local indeterminacy. In this case, it is possible to construct sunspot equilibria where extrinsic uncertainty matters. In this paper, I provide a global analysis of their model revealing the ...

The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The most popular SAT algorithms are based on the well known Davis-Putnam procedure. There, to guide search, a branching rule is applied for selecting still unassigned variables and computing an assignment to this variable. Additionally, conflict analysis metho...

Most global constraints maintain a support for their filtering algorithm, namely a tuple consistent with both the constraint and current domains. However, this highly valuable information is rarely used outside of the constraint. In this paper we define the TV-Break Packing problem (TVBP) and we propose a generic hybridization scheme that we test on this real-world application. The principle of...

The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The application of SAT solvers in VLSI CAD has become of major interest. The most popular SAT algorithms are based on the well known Davis-Putnam procedure. There, to guide the search, a branching rule is applied for selecting and assigning unassigned variable...

Abstract —In recent years, a number of reliable multicast protocols on transport layer have been proposed. Previous analysis and simulation studies gave evidence for the superiority of tree-based approaches in terms of throughput and bandwidth requirements. In many tree-based protocols, the nodes of the tree are formed of multicast group members. In this case, the branching factor, i.e. the max...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

in this paper we proposed a cellular automaton based local algorithm to solve the autonomously sensor gathering problem in mobile wireless sensor networks (mwsn). in this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. the sensors decide to move only based on their local information. cellular automaton (ca) as dynamical sy...

Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. We prove that MinLOB is polynomial-time solvable for acyclic digraphs. In general, MinLOB is NP-hard and we consider three parameterizations of MinLOB. We prove that two of them are NP-complete for every va...