{"id":"https://openalex.org/W7133190450","doi":"https://doi.org/10.1016/j.tcs.2026.115842","title":"Lower bounds for approximate (& exact) k-Disjoint-Shortest-Paths","display_name":"Lower bounds for approximate (& exact) k-Disjoint-Shortest-Paths","publication_year":2026,"publication_date":"2026-03-02","ids":{"openalex":"https://openalex.org/W7133190450","doi":"https://doi.org/10.1016/j.tcs.2026.115842"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2026.115842","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115842","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2026.115842","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012330722","display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-6098-7770","affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Samuel Thomas","orcid":"https://orcid.org/0000-0002-6278-6833"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samuel Thomas","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-6278-6833","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087794199","display_name":"Anthony Wirth","orcid":"https://orcid.org/0000-0003-3746-6704"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anthony Wirth","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3746-6704","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012330722"],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.47470162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1072","issue":null,"first_page":"115842","last_page":"115842"},"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.9229999780654907,"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.9229999780654907,"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.015399999916553497,"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.010400000028312206,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42910000681877136},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.26420000195503235},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.25760000944137573},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.24629999697208405}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5755000114440918},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42910000681877136},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42890000343322754},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3610999882221222},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3571999967098236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27730000019073486},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2676999866962433},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.24629999697208405}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.tcs.2026.115842","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115842","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/4ba708f6-5680-435d-a21f-867f3e998b15","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/4ba708f6-5680-435d-a21f-867f3e998b15","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chitnis, R, Thomas, S & Wirth, A 2026, 'Lower Bounds for Approximate ( & Exact) k-Disjoint-Shortest-Paths', Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2026.115842","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2026.115842","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115842","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2005079828","https://openalex.org/W2061513598","https://openalex.org/W2079155561","https://openalex.org/W2102722785","https://openalex.org/W2115589427","https://openalex.org/W2130190334","https://openalex.org/W2151715608","https://openalex.org/W2569646339","https://openalex.org/W2891649990","https://openalex.org/W2902959544","https://openalex.org/W2963908100","https://openalex.org/W3044099633","https://openalex.org/W3122423875"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-17T06:59:57.516163","created_date":"2026-03-03T00:00:00"}