676 search results - page 43 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
135
Voted
TSP
2010
14 years 8 months 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...
116
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
126
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
112
click to vote
SIGMETRICS
2008
ACM
15 years 1 months ago
2008
ACM
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
188
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...