{"id":"https://openalex.org/W10992861","doi":"https://doi.org/10.1016/s0020-0190(99)00048-4","title":"On the approximation hardness of dense TSP and other path problems","display_name":"On the approximation hardness of dense TSP and other path problems","publication_year":1999,"publication_date":"1999-04-01","ids":{"openalex":"https://openalex.org/W10992861","doi":"https://doi.org/10.1016/s0020-0190(99)00048-4","mag":"10992861"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(99)00048-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(99)00048-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"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/A5111734790","display_name":"Wenceslas Fernandez de la Vega","orcid":null},"institutions":[{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"W. Fernandez de la Vega","raw_affiliation_strings":["Universite d'Orsay, LRI-Bat 490, 91405 Orsay Cedex, France"],"affiliations":[{"raw_affiliation_string":"Universite d'Orsay, LRI-Bat 490, 91405 Orsay Cedex, France","institution_ids":["https://openalex.org/I4210144804"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. Karpinski","raw_affiliation_strings":["Universite d'Orsay, LRI-Bat 490, 91405 Orsay Cedex, France"],"affiliations":[{"raw_affiliation_string":"Universite d'Orsay, LRI-Bat 490, 91405 Orsay Cedex, France","institution_ids":["https://openalex.org/I4210144804"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111734790"],"corresponding_institution_ids":["https://openalex.org/I4210144804"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":2.1778,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.8478285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"70","issue":"2","first_page":"53","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9318000078201294,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9318000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6845210790634155},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5931780338287354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4626292884349823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38905930519104004},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3616073429584503},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.338332861661911},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30654972791671753},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06313905119895935}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6845210790634155},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5931780338287354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4626292884349823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38905930519104004},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3616073429584503},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.338332861661911},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30654972791671753},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06313905119895935}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0020-0190(99)00048-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(99)00048-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"mag:10992861","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/eccc-reports/1998/TR98-024/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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.2142","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.2142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://theory.cs.uni-bonn.de/pub/reports/cs-reports/1998/85187-cs.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2380326504","https://openalex.org/W2068872374","https://openalex.org/W2307197129","https://openalex.org/W2385598095","https://openalex.org/W2057727496"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}