287 search results - page 35 / 58 » Constant Factor Approximations for the Hotlink Assignment Pr... |
IPCO
2010
13 years 10 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...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
LATIN
2010
Springer
14 years 1 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
SODA
2010
ACM
13 years 7 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
FOCS
1999
IEEE
14 years 29 days ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...