On minimum stars, minimum Steiner stars, and maximum matchings

Authors:
Sándor P. Fekete;Henk Meijer
Affiliations:
Center for Parallel Computing, Universität zu Köln, 50923 Köln, Germany;Department of Computer Science, Queen's University, Kingston, Ont K7L 3N6, Canada
Venue:
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Year:
1999

Citing 7
Cited 0

The algebraic degree of geometric optimization problems

Discrete & Computational Geometry
Designing least-cost nonblocking broadband networks

Journal of Algorithms
A maximum b-matching problem arising from median location models with applications to the roommates problem

Mathematical Programming: Series A and B
Simplicity and hardness of the maximum traveling salesman problem under geometric distances

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Linear time bounds for median computations

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract