{"id":"https://openalex.org/W7224910702","doi":"https://doi.org/10.5281/zenodo.23808342","title":"Near-Quadratic Inapproximability of Multi-Agent Pathfinding on Strongly Biconnected Digraphs","display_name":"Near-Quadratic Inapproximability of Multi-Agent Pathfinding on Strongly Biconnected Digraphs","publication_year":2026,"publication_date":"2026-10-30","ids":{"openalex":"https://openalex.org/W7224910702","doi":"https://doi.org/10.5281/zenodo.23808342"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.23808342","doi":"https://doi.org/10.5281/zenodo.23808342","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23808342","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"volume":null,"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.23808342","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5159538006","display_name":"Shardul Mishra","orcid":"https://orcid.org/0009-0005-4164-7569","observed_orcids":["https://orcid.org/0009-0005-4164-7569"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mishra, Shardul","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0005-4164-7569","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5159538006"],"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9678000211715698,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9678000211715698,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.026499999687075615,"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/T12288","display_name":"Optimization and Search Problems","score":0.001500000013038516,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/multi-agent-pathfinding","display_name":"multi-agent path finding","score":0.9990000128746033},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.8029999732971191},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.6840000152587891},{"id":"https://openalex.org/keywords/makespan","display_name":"makespan","score":0.6100000143051147},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6579999923706055},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.675000011920929},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6150000095367432}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5756000280380249},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5751000046730042},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5674999952316284},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.48080000281333923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4684000015258789},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4424999952316284},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4410000145435333},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.39089998602867126},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3799999952316284},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.37209999561309814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35670000314712524},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.35519999265670776},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3531000018119812},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3497999906539917},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.3474000096321106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34310001134872437},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.32679998874664307},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.3018999993801117},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2946999967098236},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.2646999955177307},{"id":"https://openalex.org/C2779089604","wikidata":"https://www.wikidata.org/wiki/Q7169333","display_name":"Permission","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.5281/zenodo.23808342","doi":"https://doi.org/10.5281/zenodo.23808342","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23808342","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.5281/zenodo.23808343","doi":"https://doi.org/10.5281/zenodo.23808343","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23808343","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.5281/zenodo.23854826","doi":"https://doi.org/10.5281/zenodo.23854826","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23854826","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.5281/zenodo.23808342","doi":"https://doi.org/10.5281/zenodo.23808342","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23808342","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4315488491","https://openalex.org/W4411011418","https://openalex.org/W4409363599","https://openalex.org/W4387171282","https://openalex.org/W3037046231","https://openalex.org/W1674626333","https://openalex.org/W2884751904","https://openalex.org/W2873758305","https://openalex.org/W4382866771","https://openalex.org/W2606892031"],"abstract_inverted_index":{"This":[0],"investigates":[1],"the":[2,27,113,123,126,141,181,188,196,201],"computational":[3],"complexity":[4,182,189],"and":[5,32,71,163,174,198,218,228],"approximability":[6],"of":[7,36,156,183,190,200,225,233],"multi-agent":[8],"pathfinding":[9],"(MAPF)":[10],"on":[11,44,118,135],"directed":[12,84,157],"graphs":[13],"where":[14],"feasible":[15,136,185],"plans":[16,186],"are":[17,77],"guaranteed":[18],"to":[19,106],"exist.":[20],"The":[21,59,79,178],"paper":[22,127],"establishes":[23,146],"near-quadratic":[24],"inapproximability":[25,41],"for":[26,42,132,151],"minimum":[28],"sequential":[29,133],"move":[30],"count":[31],"parallel":[33],"final-arrival":[34],"sum":[35],"costs,":[37],"together":[38],"with":[39,49,93],"near-linear":[40],"makespan,":[43],"always-feasible":[45],"strongly":[46,90,137],"biconnected":[47,91,138],"digraphs":[48],"at":[50],"least":[51],"two":[52],"unoccupied":[53],"vertices,":[54],"unless":[55],"P":[56],"=":[57],"NP.":[58],"hardness":[60,142,214],"results":[61,168],"remain":[62],"valid":[63],"under":[64],"multiple":[65],"parallel-movement":[66],"conventions":[67],"governing":[68],"following":[69],"chains":[70],"occupied-cycle":[72],"rotations,":[73],"while":[74,194],"head-on":[75],"swaps":[76],"forbidden.":[78],"central":[80],"reduction":[81],"embeds":[82],"a":[83,89,147,152],"acyclic":[85],"feasibility":[86],"problem":[87],"into":[88],"network":[92],"occupied":[94],"ballast":[95],"structures.":[96],"Escaping":[97],"an":[98,129],"infeasible":[99,119],"core":[100],"forces":[101],"initially":[102],"correctly":[103],"placed":[104],"agents":[105],"undertake":[107],"long":[108],"restoration":[109],"walks,":[110],"thereby":[111],"generating":[112],"approximation":[114,131,150,203,216],"gap":[115],"without":[116],"relying":[117],"output":[120],"instances.":[121],"On":[122],"constructive":[124],"side,":[125],"derives":[128],"O(n\u00b2)":[130],"moves":[134],"instances,":[139],"matching":[140],"exponent.":[143],"It":[144],"also":[145],"7n\u00b2":[148],"sum-of-costs":[149],"broad":[153],"certified":[154],"family":[155],"networks,":[158],"using":[159],"adaptive":[160],"cycle":[161],"selection":[162],"bounded-length":[164],"agent\u2013hole":[165],"exchanges.":[166],"Additional":[167],"address":[169],"passing-bay":[170],"algorithms,":[171],"movement":[172],"semantics":[173],"structural":[175,202],"graph":[176],"conditions.":[177],"work":[179],"separates":[180],"finding":[184],"from":[187],"approximating":[191],"optimal":[192],"plans,":[193],"identifying":[195],"scope":[197],"limitations":[199],"guarantees.":[204],"Deposited":[205],"materials":[206],"Main":[207],"research":[208],"manuscript":[209],"(27":[210],"pages),":[211],"including":[212],"definitions,":[213],"theorems,":[215],"algorithms":[217],"mathematical":[219],"appendices.":[220],"Author:":[221],"Shardul":[222,239],"Mishra,":[223],"School":[224],"Computer":[226],"Science":[227],"Engineering":[229],"(SCOPE),":[230],"Vellore":[231],"Institute":[232],"Technology,":[234],"India.":[235],"Copyright:":[236],"\u00a9":[237],"2026":[238],"Mishra.":[240],"All":[241],"rights":[242],"reserved.":[243]},"counts_by_year":[],"updated_date":"2026-11-02T09:45:03.842371","created_date":"2026-10-31T00:00:00"}