Sciweavers

Share
708 search results - page 1 / 142
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
CORR
2012
Springer
224views Education» more  CORR 2012»
8 years 6 months ago
On Approximation Lower Bounds for TSP with Bounded Metrics
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...
Marek Karpinski, Richard Schmied
SODA
2008
ACM
156views Algorithms» more  SODA 2008»
10 years 3 days ago
Approximating TSP on metrics with bounded global growth
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
T.-H. Hubert Chan, Anupam Gupta
TSP
2010
9 years 5 months ago
Barankin-type lower bound on multiple change-point estimation
We compute lower bounds on the mean-square error of multiple change-point estimation. In this context, the parameters are discrete and the Cram
Patricio S. La Rosa, Alexandre Renaux, Carlos H. M...
CORR
2010
Springer
249views Education» more  CORR 2010»
9 years 10 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
CORR
2011
Springer
192views Education» more  CORR 2011»
9 years 5 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy
books