Lectures on Proof Verification and Approximation Algorithms pp 313-323 | Cite as

Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces

• Authors
• Authors and affiliations

• Richard Mayr
• Annette Schelten

Chapter

First Online: 20 May 2006

• 2 Readers
• 443 Downloads

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1367)

Keywords

Line Segment Polynomial Time Travel Salesman Problem Steiner Tree Structure Theorem 

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

• Richard Mayr
• Annette Schelten

There are no affiliations available