{"id":"https://openalex.org/W2757042684","doi":"https://doi.org/10.1137/17m1152115","title":"On the Circuit Diameter of Some Combinatorial Polytopes","display_name":"On the Circuit Diameter of Some Combinatorial Polytopes","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2757042684","doi":"https://doi.org/10.1137/17m1152115","mag":"2757042684"},"language":"en","primary_location":{"id":"doi:10.1137/17m1152115","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1152115","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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":"SIAM Journal on Discrete Mathematics","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/A5039806750","display_name":"Sean Kafer","orcid":"https://orcid.org/0000-0002-0779-6801"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sean Kafer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070593699","display_name":"Kanstantsin Pashkovich","orcid":"https://orcid.org/0000-0001-5290-1474"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kanstantsin Pashkovich","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051955401","display_name":"Laura Sanit\u00e0","orcid":"https://orcid.org/0000-0002-6384-1857"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laura Sanit\u00e0","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.415,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.82798445,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"33","issue":"1","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9966999888420105,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9966999888420105,"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.9901000261306763,"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.9894999861717224,"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/polytope","display_name":"Polytope","score":0.8919068574905396},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.836671769618988},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7373359203338623},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6526864767074585},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6349235773086548},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5889572501182556},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5079241394996643},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4911210238933563},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.47375231981277466},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34243303537368774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22939357161521912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15810033679008484},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07509312033653259},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05556163191795349}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8919068574905396},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.836671769618988},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7373359203338623},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6526864767074585},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6349235773086548},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5889572501182556},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5079241394996643},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4911210238933563},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.47375231981277466},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34243303537368774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22939357161521912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15810033679008484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07509312033653259},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05556163191795349},{"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.1137/17m1152115","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1152115","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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":"SIAM Journal on Discrete Mathematics","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":29,"referenced_works":["https://openalex.org/W1528072933","https://openalex.org/W1964903681","https://openalex.org/W1966068899","https://openalex.org/W1979802116","https://openalex.org/W1981894795","https://openalex.org/W1985101250","https://openalex.org/W1985422831","https://openalex.org/W1987493955","https://openalex.org/W1991528957","https://openalex.org/W2033662447","https://openalex.org/W2038964118","https://openalex.org/W2058408846","https://openalex.org/W2111678432","https://openalex.org/W2139431443","https://openalex.org/W2149580763","https://openalex.org/W2151888904","https://openalex.org/W2154717459","https://openalex.org/W2210056327","https://openalex.org/W2258857078","https://openalex.org/W2260470032","https://openalex.org/W2327315803","https://openalex.org/W2337193349","https://openalex.org/W2486813313","https://openalex.org/W2962693383","https://openalex.org/W2962838697","https://openalex.org/W2963048153","https://openalex.org/W2963380173","https://openalex.org/W2964045245","https://openalex.org/W3105031228"],"related_works":["https://openalex.org/W2572756133","https://openalex.org/W1563568831","https://openalex.org/W2135149549","https://openalex.org/W4294358747","https://openalex.org/W1604040598","https://openalex.org/W2341709160","https://openalex.org/W2758988501","https://openalex.org/W4236147943","https://openalex.org/W1596059437","https://openalex.org/W3013791021"],"abstract_inverted_index":{"The":[0],"combinatorial":[1,33,92],"diameter":[2,37,86],"of":[3,11,18,26,38,46,53,62,74,77,87],"a":[4,12,47],"polytope":[5],"$P$":[6,27,39],"is":[7,40],"the":[8,21,24,32,35,43,56,75,84,97,100,105],"maximum":[9,44],"value":[10,45],"shortest":[13,48],"path":[14,22,49,57],"between":[15,50],"two":[16,51],"vertices":[17,52],"$P$,":[19,54,63],"where":[20,55],"uses":[23,58],"edges":[25],"only.":[28],"In":[29,79],"contrast":[30],"to":[31,90],"diameter,":[34],"circuit":[36,85],"defined":[41],"as":[42,96],"potential":[59],"edge":[60,66],"directions":[61,67],"i.e.,":[64],"all":[65],"that":[68],"can":[69],"arise":[70],"by":[71],"translating":[72],"some":[73],"facets":[76],"$P$.":[78],"this":[80],"paper,":[81],"we":[82],"study":[83],"polytopes":[88],"corresponding":[89],"classical":[91],"optimization":[93],"problems,":[94],"such":[95],"matching":[98],"polytope,":[99,103],"Traveling":[101],"Salesman":[102],"and":[104],"fractional":[106],"stable":[107],"set":[108],"polytope.":[109]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}