Part of the Lecture Notes in Computer Science book series (LNCS, volume 1367)
Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces
KeywordsLine 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.
Unable to display preview. Download preview PDF.
© Springer-Verlag 1998