455 search results - page 23 / 91 » Approximation Algorithms for Partial Covering Problems |
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
IPCO
2010
14 years 11 months ago
2010
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
SIGECOM
2003
ACM
15 years 2 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...