676 search results - page 21 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
84
Voted
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— A main difficulty for orbit determination of space debris is the correlation of tracks of data belonging to the same physical object. A sequence of optical measurements of an ...
IPL
2002
14 years 11 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
NIPS
2007
15 years 1 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
109
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
SIROCCO
2004
15 years 1 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...