Results 11 to 20 of about 2,298,639 (295)

New algorithms for Exact Satisfiability [PDF]

Theoretical Computer Science, 2005
The Exact Satisfiability problem is to determine if a CNF-formula has a truth assignment satisfying exactly one literal in each clause; Exact 3-Satisfiability is the version in which each clause contains at most three literals.
Madsen, Bolette Ammitzbøll, Byskov, Jesper Makholm, Skjernaa, Bjarke   +2 more
core   +7 more sources

Exact and Parameterized Algorithms for Choosability

Acta Informatica
In the Choosability problem (or list chromatic number problem), for a given graph G, we need to find the smallest k such that G admits a list coloring for any list assignment where all lists contain at least k colors.
Klasing, Ralf, Bliznets, Ivan, Nederlof, Jesper, Gaspers, Serge, Fernau, Henning, Sub Algorithms and Complexity, Algorithms and Complexity   +6 more
core   +6 more sources

Exact Algorithms for Exact Satisfiability Problems

, 2006
This thesis presents exact means to solve a family of NP-hard problems. Starting with the well-studied Exact Satisfiability problem (XSAT) parents, siblings and daughters are derived and studied, each with interesting practical and theoretical properties.
Dahllöf, Vilhelm
core   +5 more sources

Separation algorithms for 0-1 knapsack polytopes [PDF]

, 2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms for them, i.e., routines for detecting when they are violated.
Letchford, Adam, Kaparis, Konstantinos
core   +4 more sources

Exact Algorithms for Edge Domination [PDF]

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Johan M. M. van Rooij, Hans L. Bodlaender   +1 more
openaire   +8 more sources

Exact Algorithms for Kayles [PDF]

, 2011
In the game of Kayles, two players select alternatingly a vertex from a given graph G, but may never choose a vertex that is adjacent or equal to an already chosen vertex. The last player that can select a vertex wins the game. In this paper, we give an exact algorithm to determine which player has a winning strategy in this game.
Hans L. Bodlaender, Dieter Kratsch
openaire   +3 more sources

Exact Algorithms for Terrain Guarding [PDF]

ACM Transactions on Algorithms, 2018
Given a 1.5-dimensional terrain T , also known as an x -monotone polygonal chain, the T errain G uarding problem seeks a set of points of minimum size on T that guards all of the points on
Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh 0001, Meirav Zehavi   +4 more
openaire   +4 more sources

A Hybrid Exact Algorithm for the TSPTW [PDF]

INFORMS Journal on Computing, 2002
The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding a minimum-cost path visiting a set of cities exactly once, where each city must be visited within a specific time window. We propose a hybrid approach for solving the TSPTW that merges Constraint Programming propagation algorithms for the feasibility viewpoint (find a ...
Filippo Focacci, Andrea Lodi 0001, Michela Milano   +2 more
openaire   +1 more source

On Exact Algorithms for Treewidth

ACM Transactions on Algorithms, 2006
We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential-time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a graph with running time O
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos   +4 more
openaire   +6 more sources

Exact and Approximation Algorithms for Clustering [PDF]

Algorithmica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pankaj K. Agarwal, Cecilia Magdalena Procopiuc   +1 more
openaire   +1 more source