Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane

A tour τ of a finite set P of points is a necklace-tour if there are disks with the points in P as centers such that two disks intersect if and only if their centers are adjacent in τ. It has been observed by Sanders that a necklace-tour is an optimal traveling salesman tour.

[1]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[2]  D. Rose,et al.  Generalized nested dissection , 1977 .

[3]  E. Balas.  Integer and Fractional Matchings , 1981 .

[4]  J. Orlin.  Working Paper Alfred P. Sloan School of Management Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem , 2008 .

[5]  P. Erdös,et al.  Geometrical Extrema Suggested by a Lemma of Besicovitch , 1951 .

[6]  N. Tomizawa,et al.  On some techniques useful for solution of transportation network problems , 1971, Networks.

[7]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[8]  Harold N. Gabow,et al.  An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems , 1983, STOC.

[9]  D. R. Fulkerson,et al.  Some Properties of Graphs with Multiple Edges , 1965, Canadian Journal of Mathematics.

[10]  E. R. Reifenberg.  A Problem on Circles , 1948 .

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[13]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[14]  Fred Supnick,et al.  A CLASS OF COMBINATORIAL EXTREMA , 1970 .