{"id":"https://openalex.org/W253190089","doi":"https://doi.org/10.1007/3-540-48224-5_17","title":"Approximation Hardness of TSP with Bounded Metrics","display_name":"Approximation Hardness of TSP with Bounded Metrics","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W253190089","doi":"https://doi.org/10.1007/3-540-48224-5_17","mag":"253190089"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48224-5_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_17","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":"article","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/A5029419425","display_name":"Lars Engebretsen","orcid":"https://orcid.org/0000-0003-2294-921X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lars Engebretsen","raw_affiliation_strings":["MIT Laboratory for Computer Science, 200 Technology Square, NE43-369, Cambridge, Massachusetts, 02139-3594","MIT Laboratory for Computer Science"],"affiliations":[{"raw_affiliation_string":"MIT Laboratory for Computer Science, 200 Technology Square, NE43-369, Cambridge, Massachusetts, 02139-3594","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"MIT Laboratory for Computer Science","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marek Karpinski","raw_affiliation_strings":["Department of Computer Science, University of Bonn, 53117, Bonn","University of Bonn"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, 53117, Bonn","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029419425"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.0968,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84995481,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":null,"first_page":"201","last_page":"212"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9778000116348267,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9778000116348267,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9747999906539917,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9667999744415283,"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/bounded-function","display_name":"Bounded function","score":0.8525568246841431},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.7806351184844971},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6352593302726746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6273946762084961},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5878412127494812},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5231688618659973},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39822953939437866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17548051476478577},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09183847904205322}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8525568246841431},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.7806351184844971},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6352593302726746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6273946762084961},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5878412127494812},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5231688618659973},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39822953939437866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17548051476478577},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09183847904205322},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/3-540-48224-5_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_17","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.3439","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.3439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nada.kth.se/~enge/papers/BoundedTSP.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.3.7814","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.7814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.cs.uni-bonn.de/ftp/reports/cs-reports/2001/85227-CS.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.7396","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.7396","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.cs.uni-bonn.de/ftp/reports/cs-reports/2000/85220-CS.ps.gz","raw_type":"text"},{"id":"mag:253190089","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/eccc-reports/2000/TR00-089/index.html","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1481223916","https://openalex.org/W1527607312","https://openalex.org/W1539551091","https://openalex.org/W1590668015","https://openalex.org/W2021625223","https://openalex.org/W2035610952","https://openalex.org/W2076386251","https://openalex.org/W2080600916","https://openalex.org/W2087226760","https://openalex.org/W2141355868","https://openalex.org/W2148352980","https://openalex.org/W2160111458","https://openalex.org/W2401610261","https://openalex.org/W2584073725"],"related_works":["https://openalex.org/W2048104107","https://openalex.org/W2079977646","https://openalex.org/W1846028264","https://openalex.org/W2966744155","https://openalex.org/W2024133435","https://openalex.org/W2150217455","https://openalex.org/W2951522903","https://openalex.org/W2971668650","https://openalex.org/W2165142526","https://openalex.org/W3081394571","https://openalex.org/W1963919276","https://openalex.org/W1519233221","https://openalex.org/W2139298384","https://openalex.org/W2060363698","https://openalex.org/W3001868306","https://openalex.org/W2969832362","https://openalex.org/W42852446","https://openalex.org/W3081784037","https://openalex.org/W3113992694","https://openalex.org/W3166880264"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}