ESA 2003 - PDF Preprint Papers

ESA 2003 European Symposium on Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ESA-2003 Paper

click to vote

ESA
2003
Springer

189views Algorithms» more ESA 2003»

On the Complexity of Approximating TSP with Neighborhoods and Related Problems

14 years 5 months ago

Download www.math.tu-berlin.de

We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be eﬃciently approximated to within any constant factor unless P = NP. This ...

Shmuel Safra, Oded Schwartz

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	189	On the Complexity of Approximating TSP with Neighborhoods and Related Problems	claim
2	141	Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves	claim
3	140	Improved Approximation of the Stable Marriage Problem	claim
4	124	The Minimum Generalized Vertex Cover Problem	claim
5	123	Experiments on Graph Clustering Algorithms	claim
6	118	The Voronoi Diagram of Planar Convex Objects	claim
7	117	Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation	claim
8	116	Smoothed Motion Complexity	claim
9	111	Fast Smallest-Enclosing-Ball Computation in High Dimensions	claim
10	110	Multicommodity Flow Approximation Used for Exact Graph Partitioning	claim
11	107	Automated Generation of Search Tree Algorithms for Graph Modification Problems	claim
12	106	Improved Competitive Guarantees for QoS Buffering	claim
13	100	Multi-player and Multi-round Auctions with Severely Bounded Communication	claim
14	100	Fast Integer Programming in Fixed Dimension	claim
15	99	Adversary Immune Leader Election in ad hoc Radio Networks	claim
16	99	Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs	claim
17	98	Network Lifetime and Power Assignment in ad hoc Wireless Networks	claim
18	98	Approximating Energy Efficient Paths in Wireless Multi-hop Networks	claim
19	97	Algorithms and Experiments for the Webgraph	claim
20	96	Streaming Geometric Optimization Using Graphics Hardware	claim
21	95	Sequencing by Hybridization in Few Rounds	claim
22	94	Semi-clairvoyant Scheduling	claim
23	93	Improved Bounds for Finger Search on a RAM	claim
24	93	Finding Short Integral Cycle Bases for Cyclic Timetabling	claim
25	90	Packing a Trunk	claim
26	85	Disjoint Unit Spheres admit at Most Two Line Transversals	claim
27	81	Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting	claim
28	79	Estimating Dominance Norms of Multiple Data Streams	claim
29	77	An Optimal Algorithm for the Maximum-Density Segment Problem	claim
30	58	Kinetic Dictionaries: How to Shoot a Moving Target	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers