511 search results - page 35 / 103 » TSP with bounded metrics |
188
click to vote
WADS
2009
Springer
16 years 20 days ago
2009
Springer
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedro...
183
click to vote
TSP
2010
15 years 23 days ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
140
Voted
IANDC
2007
15 years 6 months ago
2007
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitat...
184
click to vote
SWAT
2010
Springer
15 years 11 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...
139
click to vote
RANDOM
2001
Springer
15 years 10 months ago
2001
Springer
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...