Results 11 to 20 of about 2,709,850 (294)

Iterative Compression and Exact Algorithms [PDF]

open access: yesTheoretical Computer Science, 2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponential time algorithms to solve NP-hard problems. We exemplify our ndings
Fomin, Fedor V.   +4 more
core   +5 more sources

Exact and Parameterized Algorithms for Choosability

open access: yesActa 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   +6 more
core   +6 more sources

Improved exact algorithms for MAX-SAT [PDF]

open access: yesDiscrete Applied Mathematics, 2002
In this paper we present improved exact and parameterized algorithms for the maximum satisfiability problem. In particular, we give an algorithm that computes a truth assignment for a boolean formula F satisfying the maximum number of clauses in time O(1.
Iyad A. Kanj, Jianer Chen
core   +4 more sources

Exact Algorithms for Exact Satisfiability Problems

open access: yes, 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]

open access: yes, 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]

open access: yesAlgorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Johan M. M. van Rooij   +1 more
openaire   +8 more sources

A Hybrid Exact Algorithm for the TSPTW [PDF]

open access: yesINFORMS 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   +2 more
openaire   +1 more source

Exact Algorithms for Terrain Guarding [PDF]

open access: yesACM 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   +4 more
openaire   +4 more sources

Exact and Fast Numerical Algorithms for the Stochastic Wave Equation [PDF]

open access: yes, 2003
On the basis of integral representations we propose fast numerical methods to solve the Cauchy problem for the stochastic wave equation without boundaries and with the Dirichlet boundary conditions.
Martin, A.   +11 more
core   +1 more source

On Exact Algorithms for Treewidth

open access: yesACM 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   +4 more
openaire   +6 more sources

Home - About - Disclaimer - Privacy