{"id":"https://openalex.org/W2574671299","doi":"https://doi.org/10.1090/dimacs/074/12","title":"Engineering label-constrained shortest-path algorithms","display_name":"Engineering label-constrained shortest-path algorithms","publication_year":2009,"publication_date":"2009-07-28","ids":{"openalex":"https://openalex.org/W2574671299","doi":"https://doi.org/10.1090/dimacs/074/12","mag":"2574671299"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/074/12","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074/12","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102734017","display_name":"Christopher D. Barrett","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Christopher Barrett","raw_affiliation_strings":["Dept. of Computer Science and Virginia Bioinformatics Institute, Virginia Tech,"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Virginia Bioinformatics Institute, Virginia Tech,","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059350239","display_name":"Keith Bisset","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keith Bisset","raw_affiliation_strings":["Dept. of Computer Science and Virginia Bioinformatics Institute, Virginia Tech,"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Virginia Bioinformatics Institute, Virginia Tech,","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032901794","display_name":"Martin H\u00f6lzer","orcid":"https://orcid.org/0000-0001-7090-8717"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Holzer","raw_affiliation_strings":["Dept. of Computer Science and Virginia Bioinformatics Institute, Virginia Tech,"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Virginia Bioinformatics Institute, Virginia Tech,","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058407079","display_name":"Goran Konjevod","orcid":"https://orcid.org/0000-0003-1377-7559"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Goran Konjevod","raw_affiliation_strings":["Department of Computer Science & Engineering, Arizona State University#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Arizona State University#TAB#","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020293284","display_name":"Madhav Marathe","orcid":"https://orcid.org/0000-0003-1653-0658"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Madhav Marathe","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (TH),"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (TH),","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (TH),"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (TH),","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5102734017"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":0.4293,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.67222222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"309","last_page":"319"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9922999739646912,"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.9922999739646912,"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.9585000276565552,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9470000267028809,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/computer-science","display_name":"Computer science","score":0.5623055696487427},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5431820750236511},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5153564810752869},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4807429313659668},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24089333415031433},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05098530650138855},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.04811844229698181}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5623055696487427},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5431820750236511},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5153564810752869},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4807429313659668},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24089333415031433},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05098530650138855},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.04811844229698181}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/074/12","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/074/12","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W16307331","https://openalex.org/W2384089948","https://openalex.org/W2026630113","https://openalex.org/W2372473202","https://openalex.org/W2354605212","https://openalex.org/W2102755248","https://openalex.org/W2324892567","https://openalex.org/W2032114043","https://openalex.org/W2376231728","https://openalex.org/W2374583081"],"abstract_inverted_index":{"We":[0,57],"consider":[1],"a":[2,12,21,32,43],"generalization":[3],"of":[4,30,45,60,75,105],"the":[5,26,38,65,90,100],"shortest-path":[6,28,67],"problem:":[7],"given":[8],"an":[9,71],"alphabet":[10],"\u03a3,":[11],"graph":[13],"Gwhose":[14],"edges":[15],"are":[16],"weighted":[17],"and":[18,20,69,81,95],"\u03a3-labeled,":[19],"regular":[22],"language":[23,82],"L?":[24],"\u03a3*,":[25],"L-constrained":[27],"problemconsists":[29],"finding":[31],"shortest":[33],"path":[34],"pin":[35],"Gsuch":[36],"that":[37,87],"concatenated":[39],"labels":[40],"along":[41],"pform":[42],"word":[44],"L.":[46],"This":[47],"definition":[48],"allows":[49],"to":[50],"model,":[51],"e.":[52],"g.,":[53],"many":[54],"traffic-planning":[55],"problems.":[56],"present":[58],"extensions":[59],"well-known":[61],"speed-up":[62],"techniques":[63],"for":[64],"standard":[66],"problem,":[68],"conduct":[70],"extensive":[72],"experimental":[73],"study":[74],"their":[76],"performance":[77],"with":[78],"various":[79],"networks":[80],"constraints.":[83],"Our":[84],"results":[85],"show":[86],"depending":[88],"on":[89],"network":[91],"type,":[92],"both":[93],"goal-directed":[94],"bidirectional":[96],"search":[97,101],"speed":[98],"up":[99],"considerably,":[102],"while":[103],"combinations":[104],"these":[106],"do":[107],"not.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}