On minimum stars and maximum matchings

Discrete and Computational Geometry

Volumn 23, Issue 3, 2000, Pages 389-407

  Fekete, S P ^a   Meijer, H ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034381182     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009508     Document Type: Article

References (17)

1. C. Bajaj. The algebraic degree of geometric optimization problems. Discrete & Computational Geometry, 3 (1988), 177-191.
2. A. I. Barvinok, D. S. Johnson, G. J. Woeginger, and R. Woodroofe. The maximum Traveling Salesman Problem under polyhedral norms. Proceedings of the 6th International Integer Programming and Combinatorial Optimization Conference (IPCO VI). LNCS 1412. Springer-Verlag, Berlin, 1998, pp. 195-201.
3. M. Ben. Lower bounds for algebraic computation trees. Proceedings of the 15th ACM Symposium on the Theory of Computing, 1983, pp. 80-86.
4. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Linear time bounds for median computations. Proceedings of the 4th ACM Symposium on the Theory of Computing, 1972, pp. 119-124.
5. Z. Drezner (ed.). Facility Location. A Survey of Applications and Methods. Springer-Verlag, New York, 1995.
6. D.-Z. Du and F. K. Hwang. A proof of the Gilbert-Pollak conjecture on the Steiner ratio. Algorithmica, 7 (1992), 121-135.
7. J. Edmonds. Maximum matching and a polyhedron with 0, 1-vertices. Journal of Research of the National Bureau of Standards (B), 69 (1965), 69-87.
8. S. P. Fekete. Simplicity and hardness of the Maximum Traveling Salesman Problem under geometric distances. Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, 1999, pp. 337-345.
9. S. P. Fekete and H. Meijer. On minimum stars, minimum Steiner stars, and maximum matchings. Proceedings of the 15th ACM Symposium on Computational Geometry, 1999, pp. 217-226.
10. J. A. Fingerhut, S. Suri, and J. S. Turner. Designing least-cost nonblocking broadband networks. Journal of Algorithms, 24 (1997), 287-309.
11. M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
12. A. J. Goldmann. Optimal center location in simple networks. Transportation Science, 5 (1971), 212-221.
13. F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. Elsevier Science, Amsterdam, 1992.
14. O. Kariv and L. S. Hakimi. An algorithmic approach to network location problems. II: The p-medians. SIAM Journal on Applied Mathematics, 37 (1979), 539-560.
15. M. Spivak. Calculus. Benjamin, Menlo Park, CA, 1967.
16. S. Suri. Problem # 5. Problem session of the 14th ACM Symposium on Computational Geometry, 1998. http://www.cs.duke.edu/~pankaj/scg98-openprobs/open-probs.html.
17. A. Tamir and J. S. B. Mitchell. A maximum b-matching problem arising from median location models with applications to the roommates problem. Mathematical Programming, 80(2) (1998), 171-194.