{"id":"https://openalex.org/W4414262760","doi":"https://doi.org/10.5070/c65365551","title":"Shortest paths on polymatroids and hypergraphic polytopes","display_name":"Shortest paths on polymatroids and hypergraphic polytopes","publication_year":2025,"publication_date":"2025-09-12","ids":{"openalex":"https://openalex.org/W4414262760","doi":"https://doi.org/10.5070/c65365551"},"language":"en","primary_location":{"id":"doi:10.5070/c65365551","is_oa":true,"landing_page_url":"https://doi.org/10.5070/c65365551","pdf_url":"https://escholarship.org/content/qt9zn8j5c8/qt9zn8j5c8.pdf","source":{"id":"https://openalex.org/S4210174179","display_name":"Combinatorial Theory","issn_l":"2766-1334","issn":["2766-1334"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorial Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://escholarship.org/content/qt9zn8j5c8/qt9zn8j5c8.pdf","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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jean Cardinal","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048260458","display_name":"Raphael Steiner","orcid":"https://orcid.org/0000-0002-4234-6136"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raphael Steiner","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011369568"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27430251,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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.9983000159263611,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7979999780654907},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.661300003528595},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5163999795913696},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.4339999854564667},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.40849998593330383},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4056999981403351},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.3928999900817871},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.37869998812675476},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.34290000796318054}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7979999780654907},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7738999724388123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7595999836921692},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.661300003528595},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5163999795913696},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4699999988079071},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.4339999854564667},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4056999981403351},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.3928999900817871},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.37869998812675476},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.34290000796318054},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.32179999351501465},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.3052000105381012},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.2874999940395355},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.26249998807907104},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.25189998745918274},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5070/c65365551","is_oa":true,"landing_page_url":"https://doi.org/10.5070/c65365551","pdf_url":"https://escholarship.org/content/qt9zn8j5c8/qt9zn8j5c8.pdf","source":{"id":"https://openalex.org/S4210174179","display_name":"Combinatorial Theory","issn_l":"2766-1334","issn":["2766-1334"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorial Theory","raw_type":"journal-article"},{"id":"pmh:doi:10.5070/C65365551","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S7407050878","display_name":"California Digital Library","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text/journal article"}],"best_oa_location":{"id":"doi:10.5070/c65365551","is_oa":true,"landing_page_url":"https://doi.org/10.5070/c65365551","pdf_url":"https://escholarship.org/content/qt9zn8j5c8/qt9zn8j5c8.pdf","source":{"id":"https://openalex.org/S4210174179","display_name":"Combinatorial Theory","issn_l":"2766-1334","issn":["2766-1334"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorial Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4414262760.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Base":[0],"polytopes":[1,10],"of":[2,18,33,44,52,61,66,72,87,93,109,114,159,171,192,245,275,294,309,312,324,337,357],"polymatroids,":[3],"also":[4,195],"known":[5,77],"as":[6,82],"generalized":[7,46],"permutohedra,":[8],"are":[9,13,28,269],"whose":[11,267,319],"edges":[12],"parallel":[14],"to":[15,128,175,241,249,285,328],"a":[16,45,53,67,94,110,115,147,151,160,168,214,220,246,251,264,276,295,302,313,316,325,330],"vector":[17],"the":[19,25,29,37,50,59,64,84,96,103,157,198,205,243,261,287,297,322,334,338],"form":[20],"\\(\\mathbf{e}_i":[21],"-":[22],"\\mathbf{e}_j\\),":[23],"where":[24,63],"\\(\\{\\mathbf{e}_i\\}_{i\\in":[26],"[n]}\\)":[27],"canonical":[30],"basis":[31],"vectors":[32],"\\(\\mathbb{R}^n\\).":[34],"We":[35,117,194],"consider":[36],"following":[38],"computational":[39],"problem:":[40],"Given":[41],"two":[42,90,291],"vertices":[43,268],"permutohedron":[47],"\\(P\\),":[48,62],"determine":[49],"length":[51,65,244,320,323],"shortest":[54,199,247,280,326,351],"path":[55,68,200,248,281,318,327],"between":[56,89,99,106,290,354],"them":[57],"on":[58],"skeleton":[60],"is":[69,123,202,207,239,263],"its":[70],"number":[71,86,170],"edges.":[73],"This":[74],"captures":[75],"many":[76],"flip":[78,104,288,352],"distance":[79,98,105,289],"problems,":[80],"such":[81],"computing":[83,286,350],"minimum":[85,169],"exchanges":[88],"spanning":[91],"trees":[92],"graph,":[95,111],"rotation":[97],"binary":[100],"search":[101],"trees,":[102],"acyclic":[107,273,292,310,355],"orientations":[108,274,293,311,356],"or":[112],"rectangulations":[113],"square.":[116],"prove":[118,196,236],"that":[119,143,166,197,237],"this":[120,141],"general":[121],"problem":[122,201,282],"\\NP-hard,":[124],"even":[125,144,259],"when":[126,145,204,260],"restricted":[127],"very":[129],"simple":[130],"polymatroids":[131],"in":[132,270,343],"\\(\\mathbb{R}^n\\)":[133],"defined":[134],"by":[135,223,333],"\\(O(n)\\)":[136],"inequalities.":[137],"Assuming":[138],"\\(\\operatorname{P}\\not=":[139],"\\operatorname{NP}\\),":[140],"shows":[142],"maximizing":[146],"linear":[148,359],"functional":[149],"over":[150],"polymatroid,":[152],"we":[153,235,300],"cannot":[154],"hope":[155],"for":[156,186,213,254,349],"existence":[158],"computationally":[161],"efficient":[162],"simplex":[163],"pivoting":[164,173],"rule":[165],"performs":[167],"nondegenerate":[172],"steps":[174],"an":[176,210,345],"optimal":[177],"solution.":[178],"Such":[179],"results":[180],"have":[181],"previously":[182],"been":[183],"shown":[184],"only":[185],"other,":[187],"arguably":[188],"more":[189],"complicated":[190],"classes":[191],"polytopes.":[193],"inapproximable":[203],"polymatroid":[206,262],"specified":[208],"via":[209],"evaluation":[211],"oracle":[212],"corresponding":[215],"submodular":[216],"function,":[217],"which":[218],"strengthens":[219],"recent":[221],"result":[222,341],"Ito,":[224],"Kakimura,":[225],"Kamiyama,":[226],"Kobayashi,":[227],"Maezawa,":[228],"Nozaki,":[229],"and":[230],"Okamoto":[231],"(ICALP'23).":[232],"More":[233],"precisely,":[234],"it":[238],"\\NP-hard":[240],"approximate":[242],"within":[250,329],"factor":[252,331],"\\((1+\\varepsilon)\\)":[253],"some":[255],"absolute":[256],"constant":[257],"\\(\\varepsilon\u203a0\\),":[258],"hypergraphic":[265],"polytope,":[266],"bijection":[271],"with":[272],"given":[277,306],"hypergraph.":[278,339],"The":[279],"then":[283],"amounts":[284],"hypergraph.On":[296],"positive":[298],"side,":[299],"provide":[301],"polynomial-time":[303,347],"algorithm":[304,348],"which,":[305],"any":[307,358],"pair":[308],"hypergraph,":[314],"computes":[315],"connecting":[317],"approximates":[321],"bounded":[332],"maximum":[335],"codegree":[336],"Our":[340],"implies":[342],"particular":[344],"exact":[346],"sequences":[353],"hypergraph.Mathematics":[360],"Subject":[361],"Classifications:":[362],"90C05,":[363],"90C08,":[364],"90C27,":[365],"90C35,":[366],"90C49,":[367],"90C57,":[368],"90C60,":[369],"05C50,":[370],"05C65,":[371],"05B35,":[372],"52B40Keywords:":[373],"Polymatroids,":[374],"Generalized":[375],"permutahedra,":[376],"Hypergraphic":[377],"polytopes,":[378],"Simplex":[379],"method,":[380],"Shortest":[381],"paths,":[382],"Polytope":[383,385],"diameter,":[384],"skeleton,":[386],"Flip":[387],"distance,":[388],"Combinatorial":[389],"reconfiguration":[390]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}