{"id":"https://openalex.org/W7134070157","doi":"https://doi.org/10.48550/arxiv.2603.05482","title":"Finding Short Paths on Simple Polytopes","display_name":"Finding Short Paths on Simple Polytopes","publication_year":2026,"publication_date":"2026-03-05","ids":{"openalex":"https://openalex.org/W7134070157","doi":"https://doi.org/10.48550/arxiv.2603.05482"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.05482","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062517940","display_name":"Alexander E. Black","orcid":"https://orcid.org/0000-0002-7445-5820"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Black, Alexander E.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128268058","display_name":"Raphael Steiner","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Steiner, Raphael","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19440219,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.4496999979019165,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.4496999979019165,"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.26190000772476196,"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.08429999649524689,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.8015000224113464},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.663100004196167},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5400000214576721},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5184999704360962},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5044999718666077},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5037000179290771},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4449000060558319},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.4124999940395355}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8102999925613403},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8015000224113464},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7961000204086304},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.663100004196167},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5400000214576721},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5184999704360962},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5044999718666077},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5037000179290771},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4449000060558319},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4327999949455261},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.4124999940395355},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.40220001339912415},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3815999925136566},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.37450000643730164},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3734000027179718},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3594000041484833},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.3409000039100647},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.3296000063419342},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.3057999908924103},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2856000065803528},{"id":"https://openalex.org/C16507315","wikidata":"https://www.wikidata.org/wiki/Q7885104","display_name":"Uniform k 21 polytope","level":5,"score":0.2827000021934509}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.05482","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.05482","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.05482","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.05482","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,72,98],"computing":[3,73],"a":[4,12,16,23,34,37,77,83,102,109,126],"shortest":[5,38],"monotone":[6],"path":[7,112],"to":[8,42],"the":[9,47,74,93],"optimum":[10],"of":[11,27,40,76,119,128],"linear":[13,110],"program":[14],"over":[15],"simple":[17,78,104],"polytope":[18,79,100],"is":[19,50,57,80],"NP-hard,":[20,81],"thus":[21],"resolving":[22,82],"2022":[24],"open":[25,85],"question":[26],"De":[28],"Loera,":[29],"Kafer,":[30],"and":[31,89,130],"Sanit\u00e0.":[32],"As":[33],"consequence,":[35],"finding":[36],"sequence":[39],"pivots":[41],"an":[43,66],"optimal":[44],"basis":[45],"with":[46],"simplex":[48],"method":[49],"NP-hard.":[51],"In":[52],"fact,":[53],"we":[54,70,96],"show":[55,71,97],"this":[56],"NP-hard":[58],"already":[59],"for":[60,107],"fractional":[61],"knapsack":[62],"polytopes.":[63],"By":[64],"applying":[65],"additional":[67],"polyhedral":[68],"construction,":[69],"diameter":[75],"2003":[84],"problem":[86],"by":[87],"Kaibel":[88,129],"Pfetsch.":[90],"Finally,":[91],"on":[92],"positive":[94],"side":[95],"every":[99],"has":[101],"small,":[103],"extended":[105],"formulation":[106],"which":[108],"length":[111],"may":[113],"be":[114],"found":[115],"between":[116],"any":[117],"pair":[118],"vertices":[120],"in":[121],"polynomial":[122],"time":[123],"building":[124],"upon":[125],"result":[127],"Kukharenko.":[131]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-07T00:00:00"}