Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 518014.0, MPI für Informatik / Algorithms and Complexity Group
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
Authors:Das, Gautam; Kapoor, Sanjiv; Smid, Michiel
Language:English
Date of Publication (YYYY-MM-DD):1997
Title of Journal:Algorithmica
Volume:19
Start Page:447
End Page:460
Review Status:Peer-review
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Article
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-CE15E244BDCE3C21C1256745002F5F55-...
ISSN:0178-4617
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.