{"id":"https://openalex.org/W1980105916","doi":"https://doi.org/10.1007/s10107-013-0643-2","title":"Dijkstra\u2019s algorithm and L-concave function maximization","display_name":"Dijkstra\u2019s algorithm and L-concave function maximization","publication_year":2013,"publication_date":"2013-02-04","ids":{"openalex":"https://openalex.org/W1980105916","doi":"https://doi.org/10.1007/s10107-013-0643-2","mag":"1980105916"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-013-0643-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-013-0643-2","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5032957138","display_name":"Kazuo Murota","orcid":"https://orcid.org/0000-0003-1518-9152"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kazuo Murota","raw_affiliation_strings":["Graduate School of Information Science and Technology, University of Tokyo, Tokyo, 113-8656, Japan","Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan","Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan 113-8656#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, University of Tokyo, Tokyo, 113-8656, Japan","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan 113-8656#TAB#","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067169957","display_name":"Akiyoshi Shioura","orcid":"https://orcid.org/0000-0002-5216-7190"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Akiyoshi Shioura","raw_affiliation_strings":["Graduate School of Information Sciences, Tohoku University, Sendai, 980-8579, Japan","Graduate School of Information Sciences, Tohoku University, Sendai, Japan","Graduate School of Information Sciences, Tohoku University, Sendai, Japan 980-8579#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Sciences, Tohoku University, Sendai, 980-8579, Japan","institution_ids":["https://openalex.org/I201537933"]},{"raw_affiliation_string":"Graduate School of Information Sciences, Tohoku University, Sendai, Japan","institution_ids":["https://openalex.org/I201537933"]},{"raw_affiliation_string":"Graduate School of Information Sciences, Tohoku University, Sendai, Japan 980-8579#TAB#","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032957138","https://openalex.org/A5067169957"],"corresponding_institution_ids":["https://openalex.org/I201537933","https://openalex.org/I74801974"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":4.6329,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.94861278,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"145","issue":"1-2","first_page":"163","last_page":"177"},"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.9915000200271606,"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.9915000200271606,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9836000204086304,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.8392554521560669},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7089874744415283},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6561233401298523},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6393513083457947},{"id":"https://openalex.org/keywords/concave-function","display_name":"Concave function","score":0.5388384461402893},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5134740471839905},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.5030459761619568},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5020177364349365},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5002164840698242},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.46281635761260986},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4317336976528168},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4282338619232178},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41283711791038513},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37780269980430603},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.32590678334236145},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3242245316505432},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2174915075302124}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8392554521560669},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7089874744415283},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6561233401298523},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6393513083457947},{"id":"https://openalex.org/C66690126","wikidata":"https://www.wikidata.org/wiki/Q2914302","display_name":"Concave function","level":3,"score":0.5388384461402893},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5134740471839905},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.5030459761619568},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5020177364349365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5002164840698242},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.46281635761260986},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4317336976528168},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4282338619232178},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41283711791038513},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37780269980430603},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.32590678334236145},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3242245316505432},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2174915075302124},{"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/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-013-0643-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-013-0643-2","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G159891768","display_name":"Development of Approximation Algorithms with Theoretical Guarantee for Integer Programming Problem with Nonlinear Constraint","funder_award_id":"24500002","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3163659628","display_name":"Unified Optimization Theory by Discrete Convex Paradigm","funder_award_id":"21360045","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W10162269","https://openalex.org/W386493121","https://openalex.org/W1503966292","https://openalex.org/W1576820654","https://openalex.org/W1604158939","https://openalex.org/W1975387839","https://openalex.org/W1977545325","https://openalex.org/W1983075526","https://openalex.org/W2012267681","https://openalex.org/W2025350305","https://openalex.org/W2035575256","https://openalex.org/W2059664817","https://openalex.org/W2070925631","https://openalex.org/W2128059732","https://openalex.org/W2169528473","https://openalex.org/W2304678994","https://openalex.org/W2988480584","https://openalex.org/W4206054140"],"related_works":["https://openalex.org/W4253588386","https://openalex.org/W2381419702","https://openalex.org/W2136320479","https://openalex.org/W2810620529","https://openalex.org/W1562631103","https://openalex.org/W2382831994","https://openalex.org/W1508906807","https://openalex.org/W2367161887","https://openalex.org/W4285816407","https://openalex.org/W2514247065"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}