WADS 2005 - PDF Preprint Papers

WADS 2005 Workshop on Algorithms and Data Structures

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WADS-2005 Paper

click to vote

WADS
2005
Springer

187views Algorithms» more WADS 2005»

Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems

13 years 10 months ago

Download www-cc.cs.uni-saarland.de

We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for �...

Markus Bläser, L. Shankar Ram, Maxim Sviriden...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	187	Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems	claim
2	162	The Minimum-Area Spanning Tree Problem	claim
3	149	Balanced Aspect Ratio Trees Revisited	claim
4	145	Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length	claim
5	133	Heap Building Bounds	claim
6	132	Communication-Aware Processor Allocation for Supercomputers	claim
7	132	k-Link Shortest Paths in Weighted Subdivisions	claim
8	122	Hinged Dissection of Polypolyhedra	claim
9	122	Parameterized Complexity of Generalized Vertex Cover Problems	claim
10	114	Linear Time Algorithms for Generalized Edge Dominating Set Problems	claim
11	114	Subquadratic Algorithms for 3SUM	claim
12	114	The Multi-radius Cover Problem	claim
13	111	On Geometric Dilation and Halving Chords	claim
14	111	Near-Optimal Pricing in Near-Linear Time	claim
15	108	Improved Fixed-Parameter Algorithms for Two Feedback Set Problems	claim
16	96	Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes	claim
17	95	Improved Approximation Bounds for Planar Point Pattern Matching	claim
18	95	Improved Combinatorial Group Testing for Real-World Problem Sizes	claim
19	88	Approximating the Online Set Multicover Problems via Randomized Winnowing	claim
20	78	The On-line Asymmetric Traveling Salesman Problem	claim
21	69	Succinct Representation of Triangulations with a Boundary	claim
22	57	Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers