{"id":"https://openalex.org/W2513073961","doi":"https://doi.org/10.1109/icton.2016.7550605","title":"Reoptimizing shortest paths: From state of the art to new recent perspectives","display_name":"Reoptimizing shortest paths: From state of the art to new recent perspectives","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2513073961","doi":"https://doi.org/10.1109/icton.2016.7550605","mag":"2513073961"},"language":"en","primary_location":{"id":"doi:10.1109/icton.2016.7550605","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icton.2016.7550605","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 18th International Conference on Transparent Optical Networks (ICTON)","raw_type":"proceedings-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/A5038612874","display_name":"Daniele Ferone","orcid":"https://orcid.org/0000-0003-4696-7826"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniele Ferone","raw_affiliation_strings":["Department of Mathematics and Applications, \u201cR. Caccioppoli\u201d University of Napoli FEDERICO II","Department of Mathematics and Applications, \"R. Caccioppoli\" University of Napoli FEDERICO II"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applications, \u201cR. Caccioppoli\u201d University of Napoli FEDERICO II","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematics and Applications, \"R. Caccioppoli\" University of Napoli FEDERICO II","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090584718","display_name":"Paola Festa","orcid":"https://orcid.org/0000-0002-2243-6054"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paola Festa","raw_affiliation_strings":["Department of Mathematics and Applications, \u201cR. Caccioppoli\u201d University of Napoli FEDERICO II","Department of Mathematics and Applications, \"R. Caccioppoli\" University of Napoli FEDERICO II"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applications, \u201cR. Caccioppoli\u201d University of Napoli FEDERICO II","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematics and Applications, \"R. Caccioppoli\" University of Napoli FEDERICO II","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040654178","display_name":"Antonio Napoletano","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Antonio Napoletano","raw_affiliation_strings":["Department of Mathematics and Applications, \u201cR. Caccioppoli\u201d University of Napoli FEDERICO II","Department of Mathematics and Applications, \"R. Caccioppoli\" University of Napoli FEDERICO II"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applications, \u201cR. Caccioppoli\u201d University of Napoli FEDERICO II","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematics and Applications, \"R. Caccioppoli\" University of Napoli FEDERICO II","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042516759","display_name":"Tommaso Pastore","orcid":"https://orcid.org/0000-0002-4121-5003"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tommaso Pastore","raw_affiliation_strings":["Department of Mathematics and Applications, \u201cR. Caccioppoli\u201d University of Napoli FEDERICO II","Department of Mathematics and Applications, \"R. Caccioppoli\" University of Napoli FEDERICO II"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Applications, \u201cR. Caccioppoli\u201d University of Napoli FEDERICO II","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematics and Applications, \"R. Caccioppoli\" University of Napoli FEDERICO II","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5038612874"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2522,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.52929618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"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.998199999332428,"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.9846000075340271,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9750000238418579,"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/computer-science","display_name":"Computer science","score":0.5399158000946045},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5191128253936768},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34550607204437256},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15422967076301575}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5399158000946045},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5191128253936768},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34550607204437256},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15422967076301575}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icton.2016.7550605","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icton.2016.7550605","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 18th International Conference on Transparent Optical Networks (ICTON)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1511571834","https://openalex.org/W1568032077","https://openalex.org/W1788719447","https://openalex.org/W1964416868","https://openalex.org/W1984057027","https://openalex.org/W1990043277","https://openalex.org/W2015648019","https://openalex.org/W2029706450","https://openalex.org/W2061159212","https://openalex.org/W2063896698","https://openalex.org/W2074609999","https://openalex.org/W2085917651","https://openalex.org/W2105874695","https://openalex.org/W2112964526","https://openalex.org/W2115106512","https://openalex.org/W2119312244","https://openalex.org/W2126106559","https://openalex.org/W2140836772","https://openalex.org/W4251801412"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"Reoptimizing":[0],"shortest":[1,9,69,99],"paths":[2],"consists":[3],"in":[4,104],"solving":[5],"a":[6,41,64,67,73],"sequence":[7],"of":[8,40,43,116,136],"path":[10,70,100],"problems,":[11],"where":[12],"each":[13],"problem":[14,49],"differs":[15],"only":[16],"slightly":[17],"from":[18,34,54,57,90],"the":[19,23,35,38,58,97,112,117,132,137],"previous":[20,59,91],"one,":[21,60],"because":[22],"origin":[24],"node":[25],"has":[26,45],"been":[27,32,46],"changed,":[28],"some":[29,126],"arcs":[30,44],"have":[31],"removed":[33],"graph,":[36],"or":[37,66],"cost":[39],"subset":[42],"modified.":[47],"Each":[48],"could":[50],"be":[51],"simply":[52],"solved":[53],"scratch,":[55],"independently":[56],"by":[61,131],"using":[62],"either":[63],"label-correcting":[65],"label-setting":[68],"algorithm.":[71],"Nevertheless,":[72],"clever":[74],"way":[75],"to":[76,80,120],"approach":[77,121],"it":[78],"is":[79],"design":[81],"ad":[82],"hoc":[83],"algorithms":[84,119],"that":[85],"efficiently":[86],"use":[87],"information":[88],"resulting":[89],"computations.":[92],"This":[93],"paper":[94],"formally":[95],"defines":[96],"different":[98,106],"reoptimization":[101],"problems":[102],"arising":[103],"several":[105],"scenarios":[107],"and/or":[108],"conditions":[109],"and":[110],"surveys":[111],"most":[113],"efficient":[114],"state":[115],"art":[118],"them.":[122],"It":[123],"also":[124],"describes":[125],"new":[127],"solution":[128],"techniques":[129],"inspired":[130],"dual":[133],"mathematical":[134],"formulation":[135],"problems.":[138]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}