Corpus ID: 14486511

8 APPROXIMATION ALGORITHMS FOR GEOMETRIC PROBLEMS

@inproceedings{Bern19958AA,
  title={8 APPROXIMATION ALGORITHMS FOR GEOMETRIC PROBLEMS},
  author={M. Bern and D. Eppstein},
  year={1995}
}

M. Bern, D. Eppstein

Published 1995

This chapter surveys approximation algorithms for hard geometric problems. The problems we consider typically take inputs that are point sets or polytopes in twoor three-dimensional space, and seek optimal constructions, (which may be trees, paths, or polytopes). We limit attention to problems for which no polynomial-time exact algorithms are known, and concentrate on bounds for worst-case approximation ratios, especially bounds that depend intrinsically on geometry. We illustrate our… CONTINUE READING

Save to Library

Create Alert

Cite

Launch Research Feed