{"id":"https://openalex.org/W4387845100","doi":"https://doi.org/10.1007/s10107-023-02025-4","title":"Inapproximability of shortest paths on perfect matching polytopes","display_name":"Inapproximability of shortest paths on perfect matching polytopes","publication_year":2023,"publication_date":"2023-10-21","ids":{"openalex":"https://openalex.org/W4387845100","doi":"https://doi.org/10.1007/s10107-023-02025-4"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-023-02025-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-023-02025-4","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5011369568","display_name":"Jean Cardinal","orcid":"https://orcid.org/0000-0002-2312-0967"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Jean Cardinal","raw_affiliation_strings":["Universit\u00e9 libre de Bruxelles (ULB), 1050, Brussels, Belgium","Universit\u00e9 libre de Bruxelles (ULB), Brussels, Belgium"],"raw_orcid":"https://orcid.org/0000-0002-2312-0967","affiliations":[{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles (ULB), 1050, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]},{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles (ULB), Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048260458","display_name":"Raphael Steiner","orcid":"https://orcid.org/0000-0002-4234-6136"},"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":false,"raw_author_name":"Raphael Steiner","raw_affiliation_strings":["ETH Z\u00fcrich, 8050, Zurich, Switzerland","ETH Z\u00fcrich, Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, 8050, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"ETH Z\u00fcrich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011369568"],"corresponding_institution_ids":["https://openalex.org/I132053463"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.4309,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65249067,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"210","issue":"1-2","first_page":"147","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996999979019165,"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.9672999978065491,"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/combinatorics","display_name":"Combinatorics","score":0.8848192691802979},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8324682116508484},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7998774647712708},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6774840354919434},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5720346570014954},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4595140516757965},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4306086301803589},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.42996877431869507},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42981192469596863},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.41903096437454224},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3429829776287079}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8848192691802979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8324682116508484},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7998774647712708},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6774840354919434},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5720346570014954},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4595140516757965},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4306086301803589},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.42996877431869507},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42981192469596863},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.41903096437454224},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3429829776287079},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-023-02025-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-023-02025-4","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1503025934","https://openalex.org/W1528072933","https://openalex.org/W1997048861","https://openalex.org/W2043434064","https://openalex.org/W2044618353","https://openalex.org/W2047001449","https://openalex.org/W2058198905","https://openalex.org/W2058408846","https://openalex.org/W2059889838","https://openalex.org/W2061874298","https://openalex.org/W2079737176","https://openalex.org/W2080654168","https://openalex.org/W2082824470","https://openalex.org/W2145799305","https://openalex.org/W2151888904","https://openalex.org/W2296148711","https://openalex.org/W2754517646","https://openalex.org/W2757042684","https://openalex.org/W2909128280","https://openalex.org/W2955954498","https://openalex.org/W2962838697","https://openalex.org/W2962848607","https://openalex.org/W2969997982","https://openalex.org/W2972926935","https://openalex.org/W2975390769","https://openalex.org/W2976085618","https://openalex.org/W2985441210","https://openalex.org/W2996397717","https://openalex.org/W3044384704","https://openalex.org/W3105031228","https://openalex.org/W3135613333"],"related_works":["https://openalex.org/W4280529077","https://openalex.org/W2371352078","https://openalex.org/W1642182499","https://openalex.org/W4286870264","https://openalex.org/W2279275934","https://openalex.org/W4304687059","https://openalex.org/W4242784854","https://openalex.org/W2963235221","https://openalex.org/W228624283","https://openalex.org/W2151412766"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}