{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:11:22Z","timestamp":1779448282824,"version":"3.53.1"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T00:00:00Z","timestamp":1772409600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115842","type":"journal-article","created":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T20:34:36Z","timestamp":1772483676000},"page":"115842","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Lower bounds for approximate (& exact) k-Disjoint-Shortest-Paths"],"prefix":"10.1016","volume":"1072","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6098-7770","authenticated-orcid":false,"given":"Rajesh","family":"Chitnis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6278-6833","authenticated-orcid":false,"given":"Samuel","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3746-6704","authenticated-orcid":false,"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2026.115842_bib0001","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","article-title":"Graph minors XIII. the disjoint paths problem","volume":"63","author":"Robertson","year":"1995","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"10.1016\/j.tcs.2026.115842_bib0002","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.jctb.2011.07.004","article-title":"The disjoint paths problem in quadratic time","volume":"102","author":"Kawarabayashi","year":"2012","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.tcs.2026.115842_bib0003","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1016\/j.jctb.2016.10.001","article-title":"Irrelevant vertices for the planar disjoint paths problem","volume":"122","author":"Adler","year":"2017","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.tcs.2026.115842_bib0004","series-title":"STOC 2020","first-page":"1307","article-title":"An exponential time parameterized algorithm for planar disjoint paths","author":"Lokshtanov","year":"2020"},{"issue":"2","key":"10.1016\/j.tcs.2026.115842_bib0005","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0166-218X(97)00121-2","article-title":"The disjoint shortest paths problem","volume":"85","author":"Eilam-Tzoreff","year":"1998","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"10.1016\/j.tcs.2026.115842_bib0006","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/18.212275","article-title":"Distributed algorithms for computing shortest pairs of disjoint paths","volume":"39","author":"Ogier","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.tcs.2026.115842_bib0007","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s11276-005-1765-0","article-title":"Finding minimum energy disjoint paths in wireless Ad-Hoc networks","volume":"11","author":"Srinivas","year":"2005","journal-title":"Wirel. Netw."},{"key":"10.1016\/j.tcs.2026.115842_bib0008","first-page":"49","article-title":"Packing paths, circuits, and cuts - A survey","author":"Frank","year":"1990","journal-title":"Paths, Flows, and VLSI-Layout"},{"key":"10.1016\/j.tcs.2026.115842_bib0009","first-page":"267","article-title":"An outline of a disjoint paths algorithm","author":"Robertson","year":"1990","journal-title":"Paths, Flows, and VLSI-Layout"},{"key":"10.1016\/j.tcs.2026.115842_bib0010","series-title":"ESA 2017","first-page":"13:1","article-title":"The directed disjoint shortest paths problem","volume":"87","author":"B\u00e9rczi","year":"2017"},{"key":"10.1016\/j.tcs.2026.115842_bib0011","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","article-title":"The directed subgraph homeomorphism problem","volume":"10","author":"Fortune","year":"1980","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115842_bib0012","article-title":"Disjoint shortest paths with congestion on DAGs","volume":"abs\/2008.08368","author":"Amiri","year":"2020","journal-title":"CoRR"},{"issue":"2","key":"10.1016\/j.tcs.2026.115842_bib0013","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","article-title":"On the complexity of k-SAT","volume":"62","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2026.115842_bib0014","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","article-title":"Which problems have strongly exponential complexity?","volume":"63","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.115842_bib0015","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1137\/21M1395089","article-title":"A tight lower bound for edge-disjoint paths on planar DAGs","volume":"37","author":"Chitnis","year":"2023","journal-title":"SIAM J. Discret. Math."},{"key":"10.1016\/j.tcs.2026.115842_bib0016","series-title":"ICALP 2021","first-page":"26:1","article-title":"Using a geometric lens to find k disjoint shortest paths","author":"Bentert","year":"2021"},{"key":"10.1016\/j.tcs.2026.115842_bib0017","series-title":"Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29, - July 3, 2020, Proceedings","first-page":"103","article-title":"Faster 2-disjoint-shortest-paths algorithm","volume":"12159","author":"Akhmedov","year":"2020"},{"issue":"1","key":"10.1016\/j.tcs.2026.115842_bib0018","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.orl.2018.11.011","article-title":"The undirected two disjoint shortest paths problem","volume":"47","author":"Gottschau","year":"2019","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.tcs.2026.115842_bib0019","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.orl.2018.11.012","article-title":"Two disjoint shortest paths problem with non-negative edge length","volume":"47","author":"Kobayashi","year":"2019","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.tcs.2026.115842_bib0020","series-title":"SODA 2021","first-page":"169","article-title":"A polynomial time algorithm for the k-disjoint shortest paths problem","author":"Lochet","year":"2021"},{"key":"10.1016\/j.tcs.2026.115842_bib0021","doi-asserted-by":"crossref","unstructured":"M. Pilipczuk, G. Stamoulis, M. W\u0142odarczyk, et al., Planar disjoint shortest paths is fixed-parameter tractable, 2025, 10.48550\/arXiv.2505.03353.","DOI":"10.1137\/1.9781611978971.165"},{"key":"10.1016\/j.tcs.2026.115842_bib0022","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","article-title":"Fixed-parameter tractability and completeness II: on completeness for w[1]","volume":"141","author":"Downey","year":"1995","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"10.1016\/j.tcs.2026.115842_bib0023","doi-asserted-by":"crossref","first-page":"1346","DOI":"10.1016\/j.jcss.2006.04.007","article-title":"Strong computational lower bounds via parameterized complexity","volume":"72","author":"Chen","year":"2006","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2026.115842_bib0024","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1137\/18M1166869","article-title":"From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more","volume":"49","author":"Chalermsook","year":"2020","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115842_bib0025","article-title":"Graph Theory, 4th Edition","author":"Diestel","year":"2012"},{"key":"10.1016\/j.tcs.2026.115842_bib0026","series-title":"ICALP 2017","first-page":"78:1","article-title":"A birthday repetition theorem and complexity of approximating dense CSPs","volume":"80","author":"Manurangsi","year":"2017"},{"key":"10.1016\/j.tcs.2026.115842_bib0027","first-page":"128","article-title":"Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover","author":"Dinur","year":"2016","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"10.1016\/j.tcs.2026.115842_bib0028","series-title":"42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4\u20137, 2025, Jena, Germany","first-page":"17:1","article-title":"Tight approximation and kernelization bounds for vertex-Disjoint shortest paths","volume":"327","author":"Bentert","year":"2025"},{"key":"10.1016\/j.tcs.2026.115842_bib0029","series-title":"FOCS 2013","first-page":"197","article-title":"The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable","author":"Cygan","year":"2013"},{"key":"10.1016\/j.tcs.2026.115842_bib0030","series-title":"35th International Symposium on Algorithms and Computation (ISAAC 2024)","first-page":"57:1","article-title":"Constant approximating disjoint paths on acyclic digraphs is w1-Hard","volume":"322","author":"W\u0142odarczyk","year":"2024"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:03:04Z","timestamp":1779447784000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":30,"alternative-id":["S0304397526001015"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115842","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Lower bounds for approximate (& exact) k-Disjoint-Shortest-Paths","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115842","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115842"}}