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.
In this paper, we present an algorithm that either reports that no necklace-tour exists or outputs a necklace-tour of a given set of n points in O(n2logn) time. If a tour is given, then we can test in O(n2) time whether or not this tour is a necklace tour. Both algorithms can be generalized to m-factors of point sets in the plane. The complexity results rely on a combinatorial analysis of certain intersection graphs of disks defined for finite sets of points in the plane.
KeywordsTraveling salesman tour m-factor disks intersection graph transportation problem linear programming combinatorial geometry computational geometry
Unable to display preview. Download preview PDF.
- [Bal]Balas, E. Integer and fractional matchings. Ann. Discrete Math. 11 (1981), 1–13.Google Scholar
- [BatEr]Bateman, P. and Erdös, P. Geometrical extrema suggested by a lemma of Besicovitch. Amer. Math. Monthly 58 (1951), 306–314.Google Scholar
- [DeMe]Derigs, U. and Metz, A. On the use of optimal fractional matchings for solving the (integer) matching problem. Computing 36 (1986), 263–270.Google Scholar
- [EbRoW]Edelsbrunner, H., Rote, G. and Welzl, E. Testing the necklace condition for shortest tours and optimal factors in the plane. Rep. 86-83, Dept. Mathematics, Technical University and University of Graz, Austria, 1986.Google Scholar
- [EmKr]Edmonds, J. and Karp, R. M. Theoretical improvements in algorithmic efficiency for network flow problems. J. Assoc. Comput. Mach. 19 (1972), 248–264.Google Scholar
- [FrTa]Fredman, M. L. and Tarjan, R. E. Fibonacci heaps and their uses in improved network optimization algorithms. In "Proc. 25th Ann. IEEE Sympos. Found. Comput. Sci. 1984", 338–346.Google Scholar
- [FuHMc]Fulkerson, D. R., Hoffman, A. J. and McAndrew, M. M. Some properties of graphs with multiple edges. Canad. J. Math. 17 (1965), 166–177.Google Scholar
- [Gb]Gabow, H. N. An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In "Proc. 15th Ann. ACM Symp. Theory Comput. Sci. 1983", 448–456.Google Scholar
- [GrJ]Garey, M. R. and Johnson, D. S. Computers and Intractability — A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.Google Scholar
- [La]Lawler, E. L. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.Google Scholar
- [LiRTa]Lipton, R. J., Rose, D. J. and Tarjan, R. E. Generalized nested dissection. SIAM J. Numer. Anal. 16 (1979), 346–358.Google Scholar
- [O]Orlin, J. B. Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem. To appear in Operations Research.Google Scholar
- [Pa]Papadimitriou, C. H. The Euclidean TSP is NP-complete. Theoret. Comput. Sci. 4 (1977), 237–244.Google Scholar
- [R]Reifenberg, E. R. A problem on circles. Math. Gaz. 32 (1948), 290–292.Google Scholar
- [Rocka]Rockafellar, R. T. Network Flows and Monotropic Optimization. Wiley-Interscience, New York, 1984.Google Scholar
- [Sa]Sanders, D. On extreme circuits. Ph.D. thesis, City College of New York, 1968.Google Scholar
- [Su]Supnick, F. A class of combinatorial extrema. Ann. New York Acad. Sci. 175 (1970), 370–382.Google Scholar
- [To]Tomizawa, N. On some techniques useful for solution of transportation network problems. Networks 1 (1972), 179–194.Google Scholar