{"id":"https://openalex.org/W1551033462","doi":"https://doi.org/10.1007/3-540-62034-6_38","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":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1551033462","doi":"https://doi.org/10.1007/3-540-62034-6_38","mag":"1551033462"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-62034-6_38","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-62034-6_38","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002203026","display_name":"Gautam Das","orcid":"https://orcid.org/0000-0002-4627-9065"},"institutions":[{"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":["US"],"is_corresponding":true,"raw_author_name":"Gautam Das","raw_affiliation_strings":["Math Sciences Dept., The University of Memphis, 38152, Memphis, TN, USA"],"affiliations":[{"raw_affiliation_string":"Math Sciences Dept., The University of Memphis, 38152, Memphis, TN, USA","institution_ids":["https://openalex.org/I94658018"]}]},{"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"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sanjiv Kapoor","raw_affiliation_strings":["Department of Computer Science, Indian Institute of Technology, Hauz Khas, 110016, New Delhi, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Indian Institute of Technology, Hauz Khas, 110016, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108374265","display_name":"Michiel Smid","orcid":null},"institutions":[{"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":["GB"],"is_corresponding":false,"raw_author_name":"Michiel Smid","raw_affiliation_strings":["Department of Computer Science, King's College London, Strand, WC2R 2LS, London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King's College London, Strand, WC2R 2LS, London, UK","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002203026"],"corresponding_institution_ids":["https://openalex.org/I94658018"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26829268,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"64","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8934236764907837},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7147431373596191},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7091558575630188},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6558611989021301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6183445453643799},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6001020669937134},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5765000581741333},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5635754466056824},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5455098748207092},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4551144242286682},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.44863951206207275},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4247468113899231},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41621583700180054},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3842393159866333},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.2745589315891266},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22668448090553284},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22428134083747864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1615510880947113},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06823700666427612},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.061472922563552856}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8934236764907837},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7147431373596191},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7091558575630188},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6558611989021301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6183445453643799},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6001020669937134},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5765000581741333},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5635754466056824},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5455098748207092},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4551144242286682},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.44863951206207275},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4247468113899231},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41621583700180054},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3842393159866333},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.2745589315891266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22668448090553284},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22428134083747864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1615510880947113},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06823700666427612},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.061472922563552856},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-62034-6_38","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-62034-6_38","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1599335667","https://openalex.org/W1992843866","https://openalex.org/W2028430839","https://openalex.org/W2055569927","https://openalex.org/W2059985428","https://openalex.org/W2093241092","https://openalex.org/W2106110423","https://openalex.org/W2110367141","https://openalex.org/W2144719726","https://openalex.org/W2911302472","https://openalex.org/W3041834803"],"related_works":["https://openalex.org/W1561849181","https://openalex.org/W3187208706","https://openalex.org/W3081212354","https://openalex.org/W2051378252","https://openalex.org/W1587959445","https://openalex.org/W98489388","https://openalex.org/W3116169590","https://openalex.org/W1985149601","https://openalex.org/W3101281637","https://openalex.org/W1703428550"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}