{"id":"https://openalex.org/W7161159110","doi":"https://doi.org/10.48550/arxiv.2605.13474","title":"On the Complexity of the Minimum-($k,\u03c1$)-Shortcut Problem","display_name":"On the Complexity of the Minimum-($k,\u03c1$)-Shortcut Problem","publication_year":2026,"publication_date":"2026-05-13","ids":{"openalex":"https://openalex.org/W7161159110","doi":"https://doi.org/10.48550/arxiv.2605.13474"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.13474","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13474","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.13474","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136164256","display_name":"Tatiana Rocha Avila","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Avila, Tatiana Rocha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122253206","display_name":"Julian Christoph Brinkmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brinkmann, Julian Christoph","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047650698","display_name":"Alexander Leonhardt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leonhardt, Alexander","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078920586","display_name":"Conrad Schecker","orcid":"https://orcid.org/0000-0002-8103-1911"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schecker, Conrad","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8084999918937683,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8084999918937683,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.08579999953508377,"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.03099999949336052,"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/undirected-graph","display_name":"Undirected graph","score":0.5821999907493591},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5083000063896179},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4717000126838684},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4050999879837036},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40380001068115234},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3799999952316284},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3776000142097473},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.3714999854564667},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.37040001153945923}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7077000141143799},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6248999834060669},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5821999907493591},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5083000063896179},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4717000126838684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44999998807907104},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4050999879837036},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40380001068115234},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3799999952316284},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3776000142097473},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.3714999854564667},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.37040001153945923},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3643999993801117},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3230000138282776},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.2980000078678131},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.25699999928474426},{"id":"https://openalex.org/C2779886137","wikidata":"https://www.wikidata.org/wiki/Q21030012","display_name":"Symmetry (geometry)","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.13474","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13474","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":"doi:10.48550/arxiv.2605.13474","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13474","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":false,"raw_source_name":null,"raw_type":"Preprint"},"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,112],"consider":[1],"the":[2,7,12,57,63,91,94,121,146,149,164,180,185,194],"Minimum-$(k,\u03c1)$-$\\mathrm{Shortcut}$":[3],"problem":[4,45,58,95,124],"($\\min(k,\u03c1)\\text{-}\\mathrm{Shortcut}$),":[5],"where":[6,93,163],"goal":[8],"is":[9,40,54,59,84,129,156],"to":[10,47,100,152],"find":[11],"smallest":[13],"set":[14],"of":[15,34,148,179,182],"shortcut":[16],"edges":[17],"such":[18],"that":[19,56,79,127,154],"every":[20],"vertex":[21],"in":[22,80,136,158,193],"a":[23,41,114,161,168],"given":[24],"graph":[25,43],"can":[26],"reach":[27],"its":[28],"$\u03c1$":[29],"closest":[30],"vertices":[31],"using":[32],"paths":[33],"at":[35],"most":[36],"$k$":[37],"edges.":[38],"This":[39],"fundamental":[42],"optimization":[44],"used":[46],"accelerate":[48],"parallel":[49],"shortest":[50],"path":[51],"algorithms.":[52],"It":[53],"well-known":[55],"trivially":[60],"solvable":[61,99,157],"for":[62,86,131,170],"cases":[64],"$k=1$":[65],"and":[66,74,116,133,139],"$k\\geq\u03c1$.":[67],"While":[68],"recent":[69],"work":[70],"by":[71],"Leonhardt,":[72],"Meyer,":[73],"Penschuck":[75],"(ESA":[76],"2024)":[77],"showed":[78],"undirected":[81,140,150],"graphs":[82],"$\\min(k,\u03c1)\\text{-}\\mathrm{Shortcut}$":[83,128],"NP-hard":[85,101,130],"$k\\geq":[87],"3$":[88],"if":[89],"$\u03c1=\u0398(n^\u03b5)$,":[90],"boundary":[92],"transitions":[96],"from":[97,120],"polynomial-time":[98],"remained":[102],"open.":[103],"In":[104],"this":[105,109],"paper,":[106],"we":[107,144,173],"narrow":[108],"gap":[110],"significantly.":[111],"present":[113],"simpler":[115],"more":[117],"direct":[118],"reduction":[119],"Hitting":[122],"Set":[123],"which":[125],"establishes":[126],"$k\\geq2$":[132],"$\u03c1\\geq":[134],"k+2$":[135],"both":[137],"directed":[138,165,195],"graphs.":[141],"Complementing":[142],"this,":[143],"use":[145],"symmetry":[147],"case":[151,189],"show":[153],"$\u03c1=k+1$":[155],"polynomial":[159],"time,":[160],"regime":[162],"version":[166],"remains":[167],"candidate":[169],"NP-hardness.":[171],"Therefore,":[172],"obtain":[174],"an":[175],"almost":[176],"complete":[177],"characterization":[178],"complexity":[181],"$\\min(k,\u03c1)\\text{-}\\mathrm{Shortcut}$,":[183],"with":[184],"sole":[186],"remaining":[187],"open":[188],"being":[190],"$\u03c1=":[191],"k+1$":[192],"setting.":[196]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-15T00:00:00"}