{"id":"https://openalex.org/W2112582109","doi":"https://doi.org/10.1007/978-3-642-40450-4_1","title":"The Online Replacement Path Problem","display_name":"The Online Replacement Path Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2112582109","doi":"https://doi.org/10.1007/978-3-642-40450-4_1","mag":"2112582109"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40450-4_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5015422703","display_name":"David Adjiashvili","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"David Adjiashvili","raw_affiliation_strings":["Institute for Operations Research (IFOR), Eidgen\u00f6ssische Technische Hochschule (ETH) Z\u00fcrich, R\u00e4mistrasse 101, 8092, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Institute for Operations Research (IFOR), Eidgen\u00f6ssische Technische Hochschule (ETH) Z\u00fcrich, R\u00e4mistrasse 101, 8092, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009089187","display_name":"Gianpaolo Oriolo","orcid":"https://orcid.org/0000-0003-2028-7005"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianpaolo Oriolo","raw_affiliation_strings":["Dipartimento di Ingegneria Civile ed Ingegneria Informatica, Universit\u00e0 di Roma Tor Vergata, Via del Politecnico 1, 00133, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria Civile ed Ingegneria Informatica, Universit\u00e0 di Roma Tor Vergata, Via del Politecnico 1, 00133, Rome, Italy","institution_ids":["https://openalex.org/I116067653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077040502","display_name":"Marco Senatore","orcid":null},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marco Senatore","raw_affiliation_strings":["Dipartimento di Ingegneria Civile ed Ingegneria Informatica, Universit\u00e0 di Roma Tor Vergata, Via del Politecnico 1, 00133, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria Civile ed Ingegneria Informatica, Universit\u00e0 di Roma Tor Vergata, Via del Politecnico 1, 00133, Rome, Italy","institution_ids":["https://openalex.org/I116067653"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015422703"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.337,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81581028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T12176","display_name":"Optimization and Packing Problems","score":0.983299970626831,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6878282427787781},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5771152973175049},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5520869493484497},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5479089021682739},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.5459392070770264},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5300193428993225},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5284823179244995},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5037297606468201},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44318878650665283},{"id":"https://openalex.org/keywords/stochastic-game","display_name":"Stochastic game","score":0.4318186342716217},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.41565749049186707},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3145911395549774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2148509919643402},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17941468954086304},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.13627350330352783},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1326000988483429},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.11992442607879639}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6878282427787781},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5771152973175049},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5520869493484497},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5479089021682739},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.5459392070770264},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5300193428993225},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5284823179244995},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5037297606468201},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44318878650665283},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.4318186342716217},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.41565749049186707},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3145911395549774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2148509919643402},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17941468954086304},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.13627350330352783},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1326000988483429},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.11992442607879639},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-40450-4_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1497822004","https://openalex.org/W1501120368","https://openalex.org/W1564217339","https://openalex.org/W1638683514","https://openalex.org/W1773616669","https://openalex.org/W1978228527","https://openalex.org/W1980494375","https://openalex.org/W1980889962","https://openalex.org/W1980943820","https://openalex.org/W1986022261","https://openalex.org/W1988593903","https://openalex.org/W1992876208","https://openalex.org/W1998002108","https://openalex.org/W2007776707","https://openalex.org/W2008896030","https://openalex.org/W2028186501","https://openalex.org/W2030776771","https://openalex.org/W2039634593","https://openalex.org/W2056325851","https://openalex.org/W2057742448","https://openalex.org/W2079318435","https://openalex.org/W2084224084","https://openalex.org/W2094099891","https://openalex.org/W2108234048","https://openalex.org/W2130626677","https://openalex.org/W2134396776","https://openalex.org/W2134729426","https://openalex.org/W2139610344","https://openalex.org/W2295958421","https://openalex.org/W2992182984","https://openalex.org/W4206064887","https://openalex.org/W4245095675"],"related_works":["https://openalex.org/W1522438124","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}