{"id":"https://openalex.org/W1594428813","doi":"https://doi.org/10.1007/pl00009183","title":"On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees","display_name":"On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees","publication_year":1997,"publication_date":"1997-12-01","ids":{"openalex":"https://openalex.org/W1594428813","doi":"https://doi.org/10.1007/pl00009183","mag":"1594428813"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009183","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009183","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://edoc.mpg.de/518014","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103264307","display_name":"Gautam K. Das","orcid":"https://orcid.org/0000-0001-7471-2885"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["DE","US"],"is_corresponding":true,"raw_author_name":"G. Das","raw_affiliation_strings":["Mathematical Sciences Department, The University of Memphis, Memphis, TN 38152, USA. dasg@next1.msci.memphis.edu.  , , , , , , US","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Mathematical Sciences Department, The University of Memphis, Memphis, TN 38152, USA. dasg@next1.msci.memphis.edu.  , , , , , , US","institution_ids":["https://openalex.org/I94658018"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062694837","display_name":"Sanjiv Kapoor","orcid":"https://orcid.org/0000-0001-5637-9919"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE","IN"],"is_corresponding":false,"raw_author_name":"S. Kapoor","raw_affiliation_strings":["Department of Computer Science, Indian Institute of Technology, Hauz Khas, New Delhi 110016, India. skapoor@cse.iitd.ernet.in., , , , , , IN","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Indian Institute of Technology, Hauz Khas, New Delhi 110016, India. skapoor@cse.iitd.ernet.in., , , , , , IN","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108374265","display_name":"Michiel Smid","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["DE","GB"],"is_corresponding":false,"raw_author_name":"M. Smid","raw_affiliation_strings":["Department of Computer Science, King's College London, Strand, London WC2R 2LS, England. michiel@dcs.kcl.ac.uk., , , , , , UK","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King's College London, Strand, London WC2R 2LS, England. michiel@dcs.kcl.ac.uk., , , , , , UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103264307"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I94658018"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.1732,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.7627241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"4","first_page":"447","last_page":"462"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.972599983215332,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.972599983215332,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9459999799728394,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9441999793052673,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8886903524398804},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7522762417793274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7193455100059509},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6680574417114258},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6596972346305847},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5608596801757812},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5499137043952942},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5338296294212341},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4853905439376831},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.459771990776062},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4235681891441345},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40772417187690735},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.250819593667984},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17426452040672302},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1535699963569641},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1474585235118866},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07964953780174255},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07027819752693176}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8886903524398804},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7522762417793274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7193455100059509},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6680574417114258},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6596972346305847},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5608596801757812},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5499137043952942},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5338296294212341},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4853905439376831},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.459771990776062},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4235681891441345},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40772417187690735},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.250819593667984},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17426452040672302},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1535699963569641},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1474585235118866},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07964953780174255},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07027819752693176},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/pl00009183","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009183","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.9488","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.9488","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.mpi-sb.mpg.de/pub/papers/reports/MPI-I-96-1-006.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.5635","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.5635","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.msci.memphis.edu/~dasg/papers/tsp-lower.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.383","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.383","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hypatia.dcs.qmw.ac.uk/data/uk/dcs.kcl.ac.uk/tr96-02.ps.gz","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:517771","is_oa":false,"landing_page_url":"http://edoc.mpg.de/517771","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chandru, V.; Vinay, V.: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, Springer, 64-75 (1996)","raw_type":"Conference-Paper"},{"id":"pmh:oai:edoc.mpg.de:518014","is_oa":true,"landing_page_url":"http://edoc.mpg.de/518014","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, v.19, 447-460 (1997)","raw_type":"Article"},{"id":"pmh:oai:pure.mpg.de:item_1331556","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-395E-F","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_1331711","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-AB91-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_1827425","is_oa":true,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-A1A1-6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Report / Max-Planck-Institut f\u00fcr Informatik","raw_type":"info:eu-repo/semantics/report"},{"id":"mag:1594428813","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1331711","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null}],"best_oa_location":{"id":"pmh:oai:edoc.mpg.de:518014","is_oa":true,"landing_page_url":"http://edoc.mpg.de/518014","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, v.19, 447-460 (1997)","raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2295800032","https://openalex.org/W2952750818","https://openalex.org/W3037667494","https://openalex.org/W2808967831","https://openalex.org/W1607540693","https://openalex.org/W3124497565","https://openalex.org/W3108024920","https://openalex.org/W2962711322","https://openalex.org/W3134871540","https://openalex.org/W2922095319","https://openalex.org/W2010303431","https://openalex.org/W2083344152","https://openalex.org/W1515796352","https://openalex.org/W1810702064","https://openalex.org/W2963678252","https://openalex.org/W1430582609","https://openalex.org/W1691602166","https://openalex.org/W1608900095","https://openalex.org/W3048039108","https://openalex.org/W2952685572"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}