676 search results - page 16 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
116
click to vote
STOC
2007
ACM
16 years 1 days ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
107
click to vote
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
98
Voted
ESA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
111
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
APPROX
2010
Springer
14 years 12 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...