151 search results - page 8 / 31 » The Minimum Generalized Vertex Cover Problem |
154
click to vote
COCOON
2004
Springer
15 years 7 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
152
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
144
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
127
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
200
Voted
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...