1389 search results - page 32 / 278 » Improved Approximation Algorithms for Label Cover Problems |
88
Voted
IPCO
2010
15 years 1 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 5 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 ...
87
Voted
SIGECOM
2003
ACM
15 years 4 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...
101
Voted
PAMI
2007
14 years 11 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...