IPCO 2001 - PDF Preprint Papers

IPCO 2001 International Conference on Integer Programming and Combinatorial Optimization

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPCO-2001 Paper

click to vote

IPCO
2001

184views Optimization» more IPCO 2001»

Approximation Algorithms for the Minimum Bends Traveling Salesman Problem

14 years 24 days ago

Download www.cs.dartmouth.edu

Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...

Clifford Stein, David P. Wagner

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	184	Approximation Algorithms for the Minimum Bends Traveling Salesman Problem	claim
2	166	Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation	claim
3	125	An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs	claim
4	117	Pruning by Isomorphism in Branch-and-Cut	claim
5	98	Independence Free Graphs and Vertex Connectivity Augmentation	claim
6	95	Bisubmodular Function Minimization	claim
7	91	Combined Connectivity Augmentation and Orientation Problems	claim
8	86	Strongly Polynomial Algorithms for the Unsplittable Flow Problem	claim
9	79	Synthesis of 2-Commodity Flow Networks	claim
10	69	On the Rank of Mixed 0, 1 Polyhedra	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers