95 search results - page 1 / 19 » Approximation of Natural W[P]-Complete Minimisation Problems... |
COCO
2008
Springer
13 years 8 months ago
2008
Springer
![Approximation of Natural W[P]-Complete Minimisation Problems Is Hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Approximation of Natural W[P]-Complete Minimisation Problems Is Hard")
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
TAMC
2009
Springer
14 years 1 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
CSR
2007
Springer
14 years 20 days ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...