{"id":"https://openalex.org/W57550275","doi":"https://doi.org/10.1007/978-3-642-27660-6_29","title":"On the Approximation Ratio of the Path Matching Christofides Algorithm","display_name":"On the Approximation Ratio of the Path Matching Christofides Algorithm","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W57550275","doi":"https://doi.org/10.1007/978-3-642-27660-6_29","mag":"57550275"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-27660-6_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-27660-6_29","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/A5021360973","display_name":"Sacha Krug","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Sacha Krug","raw_affiliation_strings":["Department of Computer Science, ETH Zurich, Switzerland","Department of Computer Science ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Department of Computer Science ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021360973"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"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.03487476,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"349","last_page":"360"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.991599977016449,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9889000058174133,"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.8868871927261353},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6821572184562683},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.6200189590454102},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.5575329065322876},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5548574924468994},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5361542105674744},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5301246047019958},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.512423574924469},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48797839879989624},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4684605300426483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4619494080543518},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4597926139831543},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3542598485946655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34418636560440063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3384771943092346}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8868871927261353},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6821572184562683},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.6200189590454102},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.5575329065322876},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5548574924468994},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5361542105674744},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5301246047019958},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.512423574924469},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48797839879989624},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4684605300426483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4619494080543518},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4597926139831543},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3542598485946655},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34418636560440063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3384771943092346},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-27660-6_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-27660-6_29","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1493027034","https://openalex.org/W1495119745","https://openalex.org/W1507039213","https://openalex.org/W1513989689","https://openalex.org/W1535315516","https://openalex.org/W1605331377","https://openalex.org/W1610317218","https://openalex.org/W1969251817","https://openalex.org/W1977056448","https://openalex.org/W2065766818","https://openalex.org/W2081860495","https://openalex.org/W2099459744","https://openalex.org/W2117226423","https://openalex.org/W2162750432","https://openalex.org/W2400247758","https://openalex.org/W2514261354","https://openalex.org/W2566631750","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W6902902722"],"related_works":["https://openalex.org/W4200179302","https://openalex.org/W1595757466","https://openalex.org/W4389782626","https://openalex.org/W2766731260","https://openalex.org/W3210931532","https://openalex.org/W2620231896","https://openalex.org/W1645834615","https://openalex.org/W87675801","https://openalex.org/W2171568915","https://openalex.org/W2038858023"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}