APPROX 2004 - PDF Preprint Papers

APPROX 2004 International Workshop on Approximation Algorithms for

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APPROX-2004 Paper

click to vote

APPROX
2004
Springer

180views Algorithms» more APPROX 2004»

A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One

13 years 10 months ago

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

We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...

Markus Bläser

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	180	A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One	claim
2	179	Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method	claim
3	165	Approximating Additive Distortion of Embeddings into Line Metrics	claim
4	149	Edge Coloring with Delays	claim
5	136	On the Crossing Spanning Tree Problem	claim
6	135	The Diameter of Randomly Perturbed Digraphs and Some Applications.	claim
7	129	The Chromatic Number of Random Regular Graphs	claim
8	125	Strong Refutation Heuristics for Random k-SAT	claim
9	122	Maximum Coverage Problem with Group Budget Constraints and Applications	claim
10	121	Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption	claim
11	120	Simultaneous Source Location	claim
12	119	Approximation Schemes for Broadcasting in Heterogenous Networks	claim
13	119	Cost-Sharing Mechanisms for Network Design	claim
14	117	The Greedy Algorithm for the Minimum Common String Partition Problem	claim
15	116	Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks	claim
16	113	Computationally-Feasible Truthful Auctions for Convex Bundles	claim
17	110	Convergence Issues in Competitive Games	claim
18	108	Estimating Frequency Moments of Data Streams Using Random Linear Combinations	claim
19	105	Counting Connected Graphs and Hypergraphs via the Probabilistic Method	claim
20	100	Estimating the Distance to a Monotone Function	claim
21	89	The Sketching Complexity of Pattern Matching	claim
22	88	A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers