A constant-factor approximation algorithm for the geometric k-MST problem in the plane

SIAM Journal on Computing

Volumn 28, Issue 3, 1999, Pages 771-781

  Mitchell, Joseph S B ^a   Blum, Avrim ^b   Chalasani, Prasad ^c   Vempala, Santosh ^b  

^a Stony Brook University   (United States)

^b Carnegie Mellon University   (United States)

^c LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Bank robber (orienteering) problem; Computational geometry; Dynamic programming; Guillotine subdivisions; k MST; Minimum spanning trees; Network optimization; Prize collecting salesman problem; Quota traveling salesman problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

GUILLOTINE SUBDIVISIONS; MINIMUM SPANNING TREES; RECTILINEAR POLYGONAL SUBDIVISIONS;

COMPUTATIONAL GEOMETRY;

EID: 0032256590     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539796303299     Document Type: Article

References (22)

1. S. ARORA, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, in Proc. 37th Ann. IEEE Sympos. Found. Comput. Sci., 1996, pp. 2-12.
2. B. AWERBUCH, Y. AZAR, A. BLUM, AND S. VEMPALA, Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen, in Proc. 27th Ann. ACM Sympos. Theory Comput., 1995, pp. 277-283.
3. E. BALAS, The prize collecting traveling salesman problem, Networks, 19 (1989), pp. 621-636.
4. D. BIENSTOCK, M. X. GOEMANS, D. SIMCHI-LEVI, AND D. WILLIAMSON, A note on the prize collecting traveling salesman problem, Math. Programming, 59 (1993), pp. 413-420.
5. A. BLUM, P. CHALASANI, D. COPPERSMITH, B. PULLEYBLANK, P. RAGHAVAN, AND M. SUDAN, The minimum latency problem, in Proc. 26th Ann. ACM Sympos. Theory Comput., 1994, pp. 163-171.
6. A. BLUM, P. CHALASANI, AND S. VEMPALA, A constant-factor approximation for the k-MST problem in the plane, in Proc. 27th Ann. ACM Sympos. Theory Comput., 1995, pp. 294-302.
7. A. BLUM, R. RAVI, AND S. VEMPALA, A constant-factor approximation algorithm for the k-MST problem, in Proc. 28th Ann. ACM Sympos. Theory Comput., 1996, pp. 442-448.
8. S. Y. CHEUNG AND A. KUMAR, Efficient quorumcast routing algorithms, in Proc. IEEE INFOCOM '94 Conference on Computer Communications, 2 (1994), pp. 840-847.
9. D.-Z. DU, L.-Q. PAN, AND M.-T. SUING, Minimum Edge Length Guillotine Rectangular Partition, Report 02418-86, Math. Sci. Res. Inst., Univ. California, Berkeley, CA, 1986.
10. D. EPPSTEIN, Faster geometric k-point MST approximation, Comput. Geom., 8 (1997), pp. 231-240.
11. M. FISCHETTI, H. W. HAMACHER, K. JORNSTEN, AND F. MAFFIOLI, Weighted k-cardinality trees: Complexity and polyhedral structure, Networks, 24 (1994), pp. 11-21.
12. N. GARG, A 3-approximation for the minimum tree spanning k vertices, in Proc. 37th Ann. IEEE Sympos. Found. Comput. Sci., 1996, pp. 302-309.
13. N. GARG AND D. S. HOCHBAUM, An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane, in Proc. 26th Ann. ACM Sympos. Theory Comput., 1994, pp. 432-438.
14. M. GOEMANS AND J. KLEINBERG, An improved approximation ratio for the minimum latency problem, in Proc. 7th ACM-SIAM Sympos. Discrete Algorithms, 1996, pp. 152-158.
15. M. GOEMANS AND D. WILLIAMSON, General approximation technique for constrained forest problems, in Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, 1992, pp. 307-315.
16. C. MATA AND J. S. B. MITCHELL, A Constant Factor Approximation Algorithm for the Red-Blue Separation Problem, Dept. of Computer Science, SUNY, Stony Brook, NY, 1995, manuscript.
17. C. MATA AND J. S. B. MITCHELL, Approximation algorithms for geometric tour and network design problems, in Proc. 11th Ann. ACM Sympos. Comput. Geom., 1995, pp. 360-369.
18. J. S. B. MITCHELL, Guillotine subdivisions approximate polygonal subdivisions: A simple new method for the geometric k-MST problem, in Proc. 7th ACM-SIAM Sympos. Discrete Algorithms, 1996, pp. 402-408.
19. J. S. B. MITCHELL, Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems, SIAM J. Comput., to appear.
20. S. RAJAGOPALAN AND V. VAZIRANI, Logarithmic Approximation of Minimum Weight k Trees, manuscript, 1995.
21. R. RAVI, R. SUNDARAM, M. V. MARATHE, D. J. ROSENKRANTZ, AND S. S. RAVI, Spanning trees short and small, in Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, 1994, pp. 546-555.
22. A. ZELIKOVSKY AND D. LOZEVANU, Minimal and bounded trees, in Tezele Cong. XVIII Acad. Romano-Americane, Kishinev, 1993, pp. 25-20.