{"id":"https://openalex.org/W4412774755","doi":"https://doi.org/10.1002/net.70002","title":"On the Complexity of the Bilevel Shortest Path Problem","display_name":"On the Complexity of the Bilevel Shortest Path Problem","publication_year":2025,"publication_date":"2025-07-30","ids":{"openalex":"https://openalex.org/W4412774755","doi":"https://doi.org/10.1002/net.70002"},"language":"en","primary_location":{"id":"doi:10.1002/net.70002","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70002","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1002/net.70002","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030771611","display_name":"Dorothee Henke","orcid":"https://orcid.org/0000-0001-9190-642X"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dorothee Henke","raw_affiliation_strings":["Chair of Business Decisions and Data Science University of Passau  Passau Germany","Chair of Business Decisions and Data Science, University of Passau, Passau, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9190-642X","affiliations":[{"raw_affiliation_string":"Chair of Business Decisions and Data Science University of Passau  Passau Germany","institution_ids":["https://openalex.org/I186354981"]},{"raw_affiliation_string":"Chair of Business Decisions and Data Science, University of Passau, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062230321","display_name":"Lasse Wulf","orcid":"https://orcid.org/0000-0001-7139-4092"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Lasse Wulf","raw_affiliation_strings":["Section for Algorithms, Logic and Graphs Technical University of Denmark  Kongens Lyngby Denmark","Section for Algorithms, Logic and Graphs, Technical University of Denmark, Kongens Lyngby, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-7139-4092","affiliations":[{"raw_affiliation_string":"Section for Algorithms, Logic and Graphs Technical University of Denmark  Kongens Lyngby Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Section for Algorithms, Logic and Graphs, Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062230321"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":{"value":3400,"currency":"USD","value_usd":3400},"fwci":2.3804,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.90306383,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"86","issue":"4","first_page":"428","last_page":"445"},"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.9860000014305115,"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.9860000014305115,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.95169997215271,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bilevel-optimization","display_name":"Bilevel optimization","score":0.6687594056129456},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6020355224609375},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.601222038269043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5269090533256531},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45063960552215576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3838048279285431},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30216020345687866},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12290611863136292},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1069367527961731},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.10640376806259155}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.6687594056129456},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6020355224609375},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.601222038269043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5269090533256531},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45063960552215576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3838048279285431},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30216020345687866},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12290611863136292},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1069367527961731},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.10640376806259155}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.70002","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70002","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1002/net.70002","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70002","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1868250634","display_name":null,"funder_award_id":"CF21\u20100302","funder_id":"https://openalex.org/F4320319444","funder_display_name":"Ny Carlsbergfondet"},{"id":"https://openalex.org/G4135731702","display_name":"Discrete Mathematics","funder_award_id":"W1230","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320319444","display_name":"Ny Carlsbergfondet","ror":null},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W20876855","https://openalex.org/W1558321388","https://openalex.org/W1996184580","https://openalex.org/W1999293689","https://openalex.org/W2011996183","https://openalex.org/W2023858465","https://openalex.org/W2041998819","https://openalex.org/W2046432398","https://openalex.org/W2065251436","https://openalex.org/W2079104779","https://openalex.org/W2091157695","https://openalex.org/W2093517413","https://openalex.org/W2111240209","https://openalex.org/W2124659975","https://openalex.org/W2164315917","https://openalex.org/W2169528473","https://openalex.org/W2499145065","https://openalex.org/W2569646339","https://openalex.org/W2573596393","https://openalex.org/W2911796152","https://openalex.org/W2928408202","https://openalex.org/W2964171616","https://openalex.org/W3107118572","https://openalex.org/W3117307077","https://openalex.org/W3159886842","https://openalex.org/W3179048041","https://openalex.org/W4205372601","https://openalex.org/W4245095675","https://openalex.org/W4311867966","https://openalex.org/W4388580578","https://openalex.org/W4406142101","https://openalex.org/W4408591426","https://openalex.org/W4411188173"],"related_works":["https://openalex.org/W4318070895","https://openalex.org/W3157915181","https://openalex.org/W4401134013","https://openalex.org/W2896140431","https://openalex.org/W1536852012","https://openalex.org/W3015956618","https://openalex.org/W1994436307","https://openalex.org/W2920493340","https://openalex.org/W2071082401","https://openalex.org/W1989923016"],"abstract_inverted_index":{"ABSTRACT":[0],"We":[1,73,158,235],"introduce":[2],"a":[3,35,41,48,118,138,141,207,239,259,273,289],"new":[4],"bilevel":[5,146,216],"version":[6,213],"of":[7,37,40,56,63,86,95,140,180,214,242,246],"the":[8,28,31,38,57,61,64,83,96,104,109,113,125,130,134,145,155,161,170,177,181,192,211,215,223,232,254,285],"classic":[9],"shortest":[10],"path":[11,49,66,119],"problem":[12,23,147,163,172,233,248,262,271,287],"and":[13,30,43,77,168,282],"completely":[14],"characterize":[15],"its":[16],"computational":[17],"complexity":[18,266],"with":[19,263],"respect":[20],"to":[21,68,102,123,150,253],"several":[22],"variants.":[24],"In":[25,143,268],"our":[26,247,270],"problem,":[27,217,256],"leader":[29,110,131],"follower":[32],"each":[33,55],"control":[34],"subset":[36],"edges":[39],"graph":[42],"together":[44],"aim":[45],"at":[46],"building":[47],"between":[50],"two":[51,58,93],"given":[52],"vertices,":[53],"while":[54,184],"players":[59],"minimizes":[60],"cost":[62,71],"resulting":[65],"according":[67],"their":[69],"own":[70],"function.":[72],"investigate":[74],"both":[75,185],"directed":[76,87,197],"undirected":[78],"graphs,":[79,199],"as":[80,82,204],"well":[81],"special":[84],"case":[85],"acyclic":[88,198],"graphs.":[89],"Moreover,":[90],"we":[91,205,227],"distinguish":[92],"versions":[94],"follower's":[97,162],"problem:":[98],"Either":[99],"they":[100,121],"have":[101,122],"complete":[103,124],"edge":[105,126],"set":[106,127],"selected":[107,128],"by":[108,129],"such":[111,132],"that":[112,133,160,169,230,277],"joint":[114,135],"solution":[115,136],"is":[116,137,164,173,250,258],"exactly":[117],"or":[120],"superset":[139],"path.":[142],"general,":[144],"turns":[148,202],"out":[149],"be":[151,279],"much":[152],"harder":[153],"in":[154,191,222],"former":[156],"case:":[157],"show":[159],"already":[165],"NP\u2010hard":[166,221],"here":[167],"leader's":[171,243],"even":[174],"hard":[175],"for":[176,196,210,238],"second":[178,224],"level":[179,189],"polynomial":[182],"hierarchy,":[183],"problems":[186],"are":[187],"one":[188,245],"easier":[190],"latter":[193],"case.":[194,225],"Interestingly,":[195],"this":[200],"difference":[201],"around,":[203],"give":[206],"polynomial\u2010time":[208,274,291],"algorithm":[209,276],"first":[212],"but":[218],"it":[219],"stays":[220],"Finally,":[226],"consider":[228],"restrictions":[229],"render":[231],"tractable.":[234],"prove":[236],"that,":[237],"constant":[240],"number":[241],"edges,":[244],"variants":[249],"actually":[251],"equivalent":[252],"shortest\u2010\u2010cycle":[255,286],"which":[257],"known":[260],"combinatorial":[261],"partially":[264],"unresolved":[265],"status.":[267],"particular,":[269],"admits":[272,288],"randomized":[275],"can":[278],"derandomized":[280],"if":[281,284],"only":[283],"deterministic":[290],"algorithm.":[292]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}