287 search results - page 3 / 58 » Constant Factor Approximations for the Hotlink Assignment Pr... |
TALG
2010
13 years 5 months ago
2010
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
ESA
2003
Springer
14 years 20 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
INFOCOM
2003
IEEE
14 years 22 days ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
TIT
2011
13 years 2 months ago
2011
We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achieva...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...