77 search results - page 3 / 16 » An exact algorithm for the capacitated vertex p-center probl... |
APPROX
2005
Springer
13 years 12 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...
COLOGNETWENTE
2008
13 years 7 months ago
2008
ALGORITHMICA
2008
13 years 6 months ago
2008
HIS
2009
13 years 4 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
FAW
2008
Springer
13 years 8 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 ...