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
    2 Citations

    References

    SHOWING 1-10 OF 119 REFERENCES
    Approximation algorithms for NP-complete problems on planar graphs
    • B. Baker
    • Mathematics, Computer Science
    • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
    • 1983
    • 918
    • PDF
    An Analysis of Several Heuristics for the Traveling Salesman Problem
    • 383
    • PDF
    Approximation Algorithms for Combinatorial Problems
    • D. Johnson
    • Mathematics, Computer Science
    • J. Comput. Syst. Sci.
    • 1974
    • 2,387
    • PDF
    Surface approximation and geometric partitions
    • 196
    • PDF
    Faster Geometric K-point MST Approximation
    • D. Eppstein
    • Mathematics, Computer Science
    • Comput. Geom.
    • 1997
    • 17
    • PDF
    Algorithms for Polytope Covering and Approximation
    • 126