Polynomial-time approximation schemes for geometric graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Thomas Erlebach Computer Engineering and Networks Laboratory, Dept. of Electrical Engineering, ETH Zürich, CH-8092 Zürich, Switzerland
Klaus Jansen Institute for Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Olshausenstr. 40, D-24098, Kiel, Germany
Eike Seidel Institute for Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Olshausenstr. 40, D-24098, Kiel, Germany
Published in:
· Proceeding
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pages 671-679
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2001
table of contents ISBN:0-89871-490-7
Polynomial-time approximation schemes for geometric graphs 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 33
· Downloads (cumulative): 633
· Citation Count: 45


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder