402 search results - page 21 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
WADS
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
Thispaper presents a new hybrid range image segmentation approach. Two separate techniques are applied consecutively. First, iin edge based segmentation technique extracts the edg...
ICALP
2010
Springer
14 years 12 days ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...