{"id":"https://openalex.org/W2164141517","doi":"https://doi.org/10.1137/s0097539792231179","title":"Scaling Algorithms for the Shortest Paths Problem","display_name":"Scaling Algorithms for the Shortest Paths Problem","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W2164141517","doi":"https://doi.org/10.1137/s0097539792231179","mag":"2164141517"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792231179","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792231179","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5111783338","display_name":"Andrew V. Goldberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111783338"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.3482,"has_fulltext":false,"cited_by_count":172,"citation_normalized_percentile":{"value":0.96305182,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"24","issue":"3","first_page":"494","last_page":"504"},"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.9995999932289124,"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.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9954000115394592,"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/scaling","display_name":"Scaling","score":0.6928232312202454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6132530570030212},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.564866304397583},{"id":"https://openalex.org/keywords/arc-length","display_name":"Arc length","score":0.5506783723831177},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5326307415962219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5278658270835876},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47138839960098267},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4270585775375366},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3859212398529053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3270748257637024},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10514923930168152},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07859739661216736}],"concepts":[{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6928232312202454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6132530570030212},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.564866304397583},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.5506783723831177},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5326307415962219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5278658270835876},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47138839960098267},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4270585775375366},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3859212398529053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3270748257637024},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10514923930168152},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07859739661216736},{"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.1137/s0097539792231179","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792231179","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":17,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1969357318","https://openalex.org/W1985882632","https://openalex.org/W2037823059","https://openalex.org/W2038643780","https://openalex.org/W2048790997","https://openalex.org/W2061872629","https://openalex.org/W2079045732","https://openalex.org/W2084224084","https://openalex.org/W2085917651","https://openalex.org/W2118382442","https://openalex.org/W2120424341","https://openalex.org/W2139559590","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2752885492","https://openalex.org/W4254807835"],"related_works":["https://openalex.org/W2373818241","https://openalex.org/W1967204917","https://openalex.org/W2368434553","https://openalex.org/W2092475372","https://openalex.org/W4248447025","https://openalex.org/W2088208555","https://openalex.org/W50580372","https://openalex.org/W2364350605","https://openalex.org/W145167312","https://openalex.org/W569048669"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2],"new":[3],"method":[4,18,73],"for":[5,9,27,69],"designing":[6],"scaling":[7],"algorithms":[8],"the":[10,28,35,42,49,53,70],"single-source":[11],"shortest":[12],"paths":[13],"problem":[14],"and":[15,32,39,45],"use":[16],"this":[17],"to":[19,62,75],"obtain":[20],"an":[21],"$O(\\sqrt":[22],"{nm}":[23],"\\log":[24],"N)$":[25],"algorithm":[26],"problem.":[29,71],"(Here":[30],"n":[31],"m":[33],"are":[34,60],"number":[36],"of":[37,52],"nodes":[38],"arcs":[40],"in":[41],"input":[43],"network":[44],"N":[46],"is":[47],"essentially":[48],"absolute":[50],"value":[51],"most":[54],"negative":[55],"arc":[56,58],"length;":[57],"lengths":[59],"assumed":[61],"be":[63],"integral.)":[64],"This":[65],"improves":[66],"previous":[67],"bounds":[68],"The":[72],"extends":[74],"related":[76],"problems.":[77]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}