{"id":"https://openalex.org/W3189065169","doi":"https://doi.org/10.4230/oasics.atmos.2021.7","title":"Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data","display_name":"Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3189065169","doi":"https://doi.org/10.4230/oasics.atmos.2021.7","mag":"3189065169"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14876","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.7","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042594597","display_name":"Niels Lindner","orcid":"https://orcid.org/0000-0002-8337-4387"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lindner, Niels","raw_affiliation_strings":["Zuse Institut Berlin, Germany","Zuse Institute Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-8337-4387","affiliations":[{"raw_affiliation_string":"Zuse Institut Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]},{"raw_affiliation_string":"Zuse Institute Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053685752","display_name":"Pedro Maristany de las Casas","orcid":"https://orcid.org/0000-0002-4197-0893"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maristany de las Casas, Pedro","raw_affiliation_strings":["Zuse Institut Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4197-0893","affiliations":[{"raw_affiliation_string":"Zuse Institut Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052903366","display_name":"Philine Schiewe","orcid":"https://orcid.org/0000-0002-4223-3246"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Schiewe, Philine","raw_affiliation_strings":["Department of Mathematics, Technische Universit\u00e4t Kaiserslautern, Germany","University of Kaiserslautern, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4223-3246","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technische Universit\u00e4t Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1544,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.43904398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"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/T11106","display_name":"Data Management and Algorithms","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9444000124931335,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.939300000667572,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7629362344741821},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6133652329444885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6032162308692932},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.550347089767456},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.54940265417099},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5076001882553101},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.472190260887146},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.46920910477638245},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.46759268641471863},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.43646135926246643},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4134526252746582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4038164019584656},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3884272575378418},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3545061945915222},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.326577365398407},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2821432948112488},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22869151830673218},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.19761478900909424},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15849703550338745}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7629362344741821},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6133652329444885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6032162308692932},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.550347089767456},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.54940265417099},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5076001882553101},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.472190260887146},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.46920910477638245},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.46759268641471863},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.43646135926246643},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4134526252746582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4038164019584656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3884272575378418},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3545061945915222},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.326577365398407},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2821432948112488},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22869151830673218},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.19761478900909424},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15849703550338745},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:14876","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.7","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},{"id":"doi:10.4230/oasics.atmos.2021.7","is_oa":true,"landing_page_url":"https://doi.org/10.4230/oasics.atmos.2021.7","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14876","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.7","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2092350596"],"related_works":["https://openalex.org/W2612665926","https://openalex.org/W2100214387","https://openalex.org/W2087932760","https://openalex.org/W2139558309","https://openalex.org/W1533159348","https://openalex.org/W2323352958","https://openalex.org/W2106003094","https://openalex.org/W2144050074","https://openalex.org/W2514270956","https://openalex.org/W2183791707","https://openalex.org/W2766388960","https://openalex.org/W2498905349","https://openalex.org/W2172035912","https://openalex.org/W2393396516","https://openalex.org/W13938931","https://openalex.org/W2159637648","https://openalex.org/W2136908693","https://openalex.org/W1487146975","https://openalex.org/W2175109984","https://openalex.org/W2787763202"],"abstract_inverted_index":{"We":[0,44],"investigate":[1],"preprocessing":[2],"for":[3,27,39,87],"single-source":[4],"shortest":[5,36,90],"path":[6,37,91],"queries":[7],"in":[8,18,51,74,81,93,99],"digraphs,":[9],"where":[10],"arc":[11,29],"costs":[12],"are":[13],"only":[14],"known":[15],"to":[16,25,70,83],"lie":[17],"an":[19],"interval.":[20],"More":[21],"precisely,":[22],"we":[23,63],"want":[24],"decide":[26],"each":[28],"whether":[30],"it":[31],"is":[32,49,77],"part":[33],"of":[34,42,96],"some":[35,40],"tree":[38],"realization":[41],"costs.":[43],"show":[45],"that":[46,62],"this":[47],"problem":[48,92],"solvable":[50],"polynomial":[52],"time":[53],"by":[54],"giving":[55],"a":[56,84],"combinatorial":[57],"algorithm,":[58],"using":[59],"optimal":[60],"structures":[61],"call":[64],"forks.":[65],"Our":[66],"algorithm":[67],"turns":[68],"out":[69],"be":[71],"very":[72],"efficient":[73],"practice,":[75],"and":[76],"sometimes":[78],"even":[79],"superior":[80],"quality":[82],"heuristic":[85],"developed":[86],"the":[88,94],"one-to-one":[89],"context":[95],"passenger":[97],"routing":[98],"public":[100],"transport.":[101]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}