English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees

MPS-Authors
/persons/resource/persons44283

Das,  Gautam
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44728

Kapoor,  Sanjiv
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45509

Smid,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dv09g
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Das, G., Kapoor, S., & Smid, M. (1996). On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. In V. Chandru, & V. Vinay (Eds.), Foundations of software technology and theoretical computer science (pp. 64-75). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AB91-3
Abstract
There is no abstract available