Guillotine subdivisions approximate polygonal subdivisions: A simple new method for the geometric k-MST problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 402-408

  Mitchell, Joseph S B ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION;

CONSTANT FACTORS; EUCLIDEAN; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; POLYNOMIAL-TIME; RECURSIVE STRUCTURE;

DYNAMIC PROGRAMMING;

EID: 0039331929     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. B. Awerbuch, Y. Azar, A. Blum, and S. Vempala. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. In Proc. 27th Annu. ACM Sympos. Theory Comput. (STOC 95), 1995.
2. E. Balas. The prize collecting traveling salesman problem. Networks, 19:621-636, 1989.
3. D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. Williamson. "A note on the prize collecting traveling salesman problem", To appear, Math. Prog.
4. A. Blum, P. Chalasani, D. Coppersmith, B. Pulley-blank, P. Raghavan, and M. Sudan. The minimum latency problem. In Proc. 26th Annu. ACM Sympos. Theory Comput. (STOC 94), 1994.
5. A. Blum, P. Chalasani, and S. Vempala. A constant-factor approximation for the k-MST problem in the plane. In Proc. 27th Annu. ACM Sympos. Theory Comput. (STOC 95), 1995.
6. S. Y. Cheung and A. Kumar. Efficient quorumcast routing algorithms. In Proc. IEEE INFOCOM '94 Conference on Computer Communications, Volume 2, pages 840-847, 1994.
7. D.-Z. Du, L.-Q. Pan, and M.-T. Shing. Minimum edge length guillotine rectangular partition. Report 02418-86, Math. Sci. Res. Inst., Univ. California, Berkeley, CA, 1986.
8. D. Eppstein. Faster geometric k-point MST approximation. Tech. Report 95-13, Dept. Inform. Comput. Sci., Univ. California, Irvine, CA, 1995.
9. M. Fischetti, H. W. Hamacher, K. Jørnsten, and F. Maffioli. Weighted k-cardinality trees: complexity and polyhedral structure. Networks, 24:11-21, 1994.
10. 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 Annu. ACM Sympos. Theory Comput. (STOC 94), pages 432-438, 1994.
11. M. Goemans and J. Kleinberg. An improved approximation ratio for the minimum latency problem. In Proc. 7th ACM-SIAM Sympos. Discrete Algorithms (SODA '96), 1996
12. M. Goemans and D. Williamson. General approximation technique for constrained forest problems. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms (SODA '92), pages 307-315, 1992.
13. C. Mata. A constant factor approximation algorithm for the red-blue separation problem. Technical report, Manuscript, Dept. of Computer Science, SUNY Stony Brook, NY, 1995.
14. C. Mata and J. S. Mitchell. Approximation algorithms for geometric tour and network design problems. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 360-369, 1995.
15. S. Rajagopalan and V. V. Vazirani. Logarithmic approximation of minimum weight k trees. Manuscript, 1995.
16. 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 (SODA '94), pages 546-555, 1994.
17. A. Zelikovsky and D. Lozevanu. Minimal and bounded trees. In Tezele Cong. XVIII Acad. Romano-Americane, Kishinev, pages 25-26, 1993.