{"id":"https://openalex.org/W1486649110","doi":"https://doi.org/10.1007/s00453-002-1008-z","title":"A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms","display_name":"A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms","publication_year":2003,"publication_date":"2003-02-07","ids":{"openalex":"https://openalex.org/W1486649110","doi":"https://doi.org/10.1007/s00453-002-1008-z","mag":"1486649110"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-002-1008-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-002-1008-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","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/A5097224180","display_name":"Bast","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bast","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik,  Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken,  bast@mpi-sb.mpg.de, mehlhorn@mpi-sb.mpg.de, schaefer@mpi-sb.mpg.de, tamaki@mpi-sb.mpg.de., Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik,  Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken,  bast@mpi-sb.mpg.de, mehlhorn@mpi-sb.mpg.de, schaefer@mpi-sb.mpg.de, tamaki@mpi-sb.mpg.de., Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097336848","display_name":"Mehlhorn","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mehlhorn","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik,  Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken,  bast@mpi-sb.mpg.de, mehlhorn@mpi-sb.mpg.de, schaefer@mpi-sb.mpg.de, tamaki@mpi-sb.mpg.de., Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik,  Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken,  bast@mpi-sb.mpg.de, mehlhorn@mpi-sb.mpg.de, schaefer@mpi-sb.mpg.de, tamaki@mpi-sb.mpg.de., Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056887495","display_name":"Markus Sch\u00e4fer","orcid":"https://orcid.org/0000-0003-4335-4098"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sch\u00e4fer","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik,  Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken,  bast@mpi-sb.mpg.de, mehlhorn@mpi-sb.mpg.de, schaefer@mpi-sb.mpg.de, tamaki@mpi-sb.mpg.de., Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik,  Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken,  bast@mpi-sb.mpg.de, mehlhorn@mpi-sb.mpg.de, schaefer@mpi-sb.mpg.de, tamaki@mpi-sb.mpg.de., Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062479597","display_name":"Tamaki","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tamaki","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik,  Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken,  bast@mpi-sb.mpg.de, mehlhorn@mpi-sb.mpg.de, schaefer@mpi-sb.mpg.de, tamaki@mpi-sb.mpg.de., Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik,  Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken,  bast@mpi-sb.mpg.de, mehlhorn@mpi-sb.mpg.de, schaefer@mpi-sb.mpg.de, tamaki@mpi-sb.mpg.de., Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5097224180"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.1994,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86732385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"36","issue":"1","first_page":"75","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"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.9958999752998352,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8329744338989258},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.730303943157196},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7168788909912109},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6845200657844543},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6553978323936462},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6464194059371948},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6441367864608765},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.570315420627594},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5584902167320251},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.49179986119270325},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4704127609729767},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4585869014263153},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4542255699634552},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45097842812538147},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4451184868812561},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43386155366897583},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4299900531768799},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4271215796470642},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4221945106983185},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.4158977270126343},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37984737753868103},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3352711796760559},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.27991998195648193},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2430117130279541},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.19977229833602905},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.14330989122390747},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.07542568445205688}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8329744338989258},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.730303943157196},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7168788909912109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6845200657844543},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6553978323936462},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6464194059371948},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6441367864608765},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.570315420627594},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5584902167320251},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.49179986119270325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4704127609729767},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4585869014263153},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4542255699634552},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45097842812538147},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4451184868812561},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43386155366897583},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4299900531768799},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4271215796470642},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4221945106983185},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.4158977270126343},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37984737753868103},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3352711796760559},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.27991998195648193},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2430117130279541},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.19977229833602905},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.14330989122390747},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.07542568445205688},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-002-1008-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-002-1008-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1485262373","https://openalex.org/W2068871408","https://openalex.org/W2080090262","https://openalex.org/W2144856557","https://openalex.org/W2174858151","https://openalex.org/W2338905098"],"related_works":["https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W3183360588","https://openalex.org/W2352589493","https://openalex.org/W2374583081","https://openalex.org/W2146609751","https://openalex.org/W3208102620","https://openalex.org/W1486649110","https://openalex.org/W2384089948","https://openalex.org/W2056754788"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}