A Constant-Factor Approximation Algorithm for the Geometrick-MST Problem in the Plane

This publication has 6 references indexed in Scilit:

• Efficient quorumcast routing algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
  SIAM Journal on Computing, 1999
• Faster geometric k-point MST approximation
  Computational Geometry, 1997
• Weightedk-cardinality trees: Complexity and polyhedral structure
  Networks, 1994
• A note on the prize collecting traveling salesman problem
  Mathematical Programming, 1993
• The prize collecting traveling salesman problem
  Networks, 1989