{"id":"https://openalex.org/W2116039769","doi":"https://doi.org/10.1007/s00453-014-9901-9","title":"Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems","display_name":"Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems","publication_year":2014,"publication_date":"2014-06-19","ids":{"openalex":"https://openalex.org/W2116039769","doi":"https://doi.org/10.1007/s00453-014-9901-9","mag":"2116039769"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-014-9901-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9901-9","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":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/5e6e0105-e738-4560-a35d-405ad81630dc","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"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"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","Max Planck Institute for informatics, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max Planck Institute for informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080169352","display_name":"Christian Engels","orcid":"https://orcid.org/0000-0003-4378-9358"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Engels","raw_affiliation_strings":["Saarland University, Saarbr\u00fccken, Germany","Saarland Univ., Saarbr\u00fccken, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Saarland Univ., Saarbr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002315999","display_name":"Bodo Manthey","orcid":"https://orcid.org/0000-0001-6278-5059"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bodo Manthey","raw_affiliation_strings":["University of Twente, Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110296299","display_name":"B. V. Raghavendra Rao","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B. V. Raghavendra Rao","raw_affiliation_strings":["Indian Institute of Technology Madras, Chennai, India","Indian Institute of Technology Madras, Chennai India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044394587"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.2951,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.59038418,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"73","issue":"1","first_page":"42","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9957000017166138,"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.9957000017166138,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T13282","display_name":"Automated Road and Building Extraction","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.687627911567688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6751689910888672},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6691537499427795},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5409297943115234},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.48852646350860596},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4791680872440338},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4652814269065857},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4496201276779175},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4465736746788025},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4454374313354492},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.43042510747909546},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.41333284974098206},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4078720211982727},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3444826602935791},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.32445424795150757},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.28917092084884644},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.22280481457710266},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07155147194862366}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.687627911567688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6751689910888672},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6691537499427795},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5409297943115234},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.48852646350860596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4791680872440338},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4652814269065857},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4496201276779175},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4465736746788025},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4454374313354492},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.43042510747909546},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.41333284974098206},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4078720211982727},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3444826602935791},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.32445424795150757},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28917092084884644},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.22280481457710266},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07155147194862366},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-014-9901-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9901-9","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"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/5e6e0105-e738-4560-a35d-405ad81630dc","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/5e6e0105-e738-4560-a35d-405ad81630dc","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bringmann, K, Engels, C, Manthey, B & Rao, B V R 2015, 'Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems', Algorithmica, vol. 73, no. 1, pp. 42-62. https://doi.org/10.1007/s00453-014-9901-9","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/5e6e0105-e738-4560-a35d-405ad81630dc","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/5e6e0105-e738-4560-a35d-405ad81630dc","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bringmann, K, Engels, C, Manthey, B & Rao, B V R 2015, 'Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems', Algorithmica, vol. 73, no. 1, pp. 42-62. https://doi.org/10.1007/s00453-014-9901-9","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5199999809265137,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W959799004","https://openalex.org/W1489238841","https://openalex.org/W1552810675","https://openalex.org/W1559839959","https://openalex.org/W1610677200","https://openalex.org/W1742022145","https://openalex.org/W1908254782","https://openalex.org/W1923505183","https://openalex.org/W1965978641","https://openalex.org/W1973264045","https://openalex.org/W1984735486","https://openalex.org/W1997263308","https://openalex.org/W2000334112","https://openalex.org/W2003207175","https://openalex.org/W2003351966","https://openalex.org/W2022179164","https://openalex.org/W2028016263","https://openalex.org/W2029360271","https://openalex.org/W2031541804","https://openalex.org/W2038033449","https://openalex.org/W2045173407","https://openalex.org/W2045762410","https://openalex.org/W2047098573","https://openalex.org/W2051213257","https://openalex.org/W2056062768","https://openalex.org/W2057795374","https://openalex.org/W2059014957","https://openalex.org/W2074567977","https://openalex.org/W2079868147","https://openalex.org/W2085637709","https://openalex.org/W2099470650","https://openalex.org/W2100172709","https://openalex.org/W2112911366","https://openalex.org/W2134865468","https://openalex.org/W2137560895","https://openalex.org/W2138146164","https://openalex.org/W2140010700","https://openalex.org/W2143037347","https://openalex.org/W2145479198","https://openalex.org/W2149720761","https://openalex.org/W2154714154","https://openalex.org/W2160575093","https://openalex.org/W2171769876","https://openalex.org/W2203109692","https://openalex.org/W2322524800","https://openalex.org/W2324108981","https://openalex.org/W2486715098","https://openalex.org/W2565166374","https://openalex.org/W2665103848","https://openalex.org/W2803653540","https://openalex.org/W2956015669","https://openalex.org/W3099638879","https://openalex.org/W3105104202"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2562562750","https://openalex.org/W2347245430","https://openalex.org/W2377950158","https://openalex.org/W2112429204","https://openalex.org/W2375775343","https://openalex.org/W4293054712","https://openalex.org/W2365712669","https://openalex.org/W4200172719","https://openalex.org/W2198982833"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}