1040 search results - page 21 / 208 » Rounding algorithms for covering problems |
FAW
2008
Springer
13 years 10 months ago
2008
Springer
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
ANTSW
2006
Springer
14 years 13 days ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...