{"id":"https://openalex.org/W4283363588","doi":"https://doi.org/10.1007/s10878-022-00876-9","title":"Online routing and searching on graphs with blocked edges","display_name":"Online routing and searching on graphs with blocked edges","publication_year":2022,"publication_date":"2022-06-22","ids":{"openalex":"https://openalex.org/W4283363588","doi":"https://doi.org/10.1007/s10878-022-00876-9"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-022-00876-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-022-00876-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-022-00876-9.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-022-00876-9.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011850965","display_name":"Davood Shiri","orcid":"https://orcid.org/0000-0003-2884-0047"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Davood Shiri","raw_affiliation_strings":["Sheffield University Management School, University of Sheffield, Conduit Road, Sheffield, S10 1FL, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-2884-0047","affiliations":[{"raw_affiliation_string":"Sheffield University Management School, University of Sheffield, Conduit Road, Sheffield, S10 1FL, United Kingdom","institution_ids":["https://openalex.org/I91136226"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070696913","display_name":"Hakan Tozan","orcid":"https://orcid.org/0000-0002-0479-6937"},"institutions":[{"id":"https://openalex.org/I3125470973","display_name":"Istanbul Medipol University","ror":"https://ror.org/037jwzz50","country_code":"TR","type":"education","lineage":["https://openalex.org/I3125470973"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Hakan Tozan","raw_affiliation_strings":["Department of Industrial Engineering, Istanbul Medipol University, Istanbul, 34810, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Istanbul Medipol University, Istanbul, 34810, Turkey","institution_ids":["https://openalex.org/I3125470973"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011850965"],"corresponding_institution_ids":["https://openalex.org/I91136226"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.2853,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56494444,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"44","issue":"2","first_page":"1039","last_page":"1059"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/competitive-analysis","display_name":"Competitive analysis","score":0.7479814291000366},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6907752752304077},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6678726077079773},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6601790189743042},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6212077140808105},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5103361010551453},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5025811195373535},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4902813732624054},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48734864592552185},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4499651789665222},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4285229742527008},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4163541793823242},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39113539457321167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2131149172782898},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08963513374328613}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7479814291000366},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6907752752304077},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6678726077079773},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6601790189743042},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6212077140808105},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5103361010551453},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5025811195373535},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4902813732624054},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48734864592552185},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4499651789665222},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4285229742527008},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4163541793823242},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39113539457321167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2131149172782898},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08963513374328613},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-022-00876-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-022-00876-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-022-00876-9.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:190031","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:44:y:2022:i:2:d:10.1007_s10878-022-00876-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-022-00876-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10878-022-00876-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-022-00876-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-022-00876-9.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4283363588.pdf","grobid_xml":"https://content.openalex.org/works/W4283363588.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W39673021","https://openalex.org/W1531274257","https://openalex.org/W1760833224","https://openalex.org/W1965155276","https://openalex.org/W1985734068","https://openalex.org/W1986937309","https://openalex.org/W1992876208","https://openalex.org/W1995434882","https://openalex.org/W2020391710","https://openalex.org/W2023146810","https://openalex.org/W2041645394","https://openalex.org/W2043815754","https://openalex.org/W2046464993","https://openalex.org/W2078856178","https://openalex.org/W2092129437","https://openalex.org/W2095419417","https://openalex.org/W2159448554","https://openalex.org/W2162228023","https://openalex.org/W2204163060","https://openalex.org/W2783063186","https://openalex.org/W2823384615","https://openalex.org/W2888711223","https://openalex.org/W2910174849","https://openalex.org/W2915058299","https://openalex.org/W2963470234","https://openalex.org/W2979739080","https://openalex.org/W3015218808","https://openalex.org/W3022326557","https://openalex.org/W3038322142","https://openalex.org/W3118763906","https://openalex.org/W3133721955","https://openalex.org/W3139171943","https://openalex.org/W3172536095","https://openalex.org/W3197467750"],"related_works":["https://openalex.org/W1996806106","https://openalex.org/W2047204419","https://openalex.org/W2092227404","https://openalex.org/W1580966357","https://openalex.org/W2772037640","https://openalex.org/W2073006754","https://openalex.org/W2954136843","https://openalex.org/W2089938457","https://openalex.org/W2093226551","https://openalex.org/W4283363588"],"abstract_inverted_index":{"Abstract":[0],"We":[1,145],"study":[2],"routing":[3],"and":[4,124,142,158,195,223],"searching":[5],"decisions":[6],"of":[7,50,79,103,176,203],"a":[8,13,26,88,121,128,150,168,183,187],"search-and-detection":[9],"(SDT)":[10],"team":[11],"on":[12,48,172,198],"road":[14],"network":[15],"under":[16,154],"online":[17,71,97],"uncertainty":[18],"setting.":[19],"Given":[20],"an":[21,32,179],"undirected":[22],"edge-weighted":[23],"bounded":[24,188],"graph,":[25,75,93],"static":[27],"target":[28,37,53,56,137],"is":[29,46,57,81,95],"positioned":[30],"at":[31],"unknown":[33,82],"vertex":[34,123],"among":[35],"potential":[36,52],"vertices":[38],"in":[39,73,91],"the":[40,51,60,74,77,84,92,99,111,136,162,173,199,204,209],"graph.":[41],"A":[42],"non-negative":[43],"search":[44,143],"cost":[45],"given":[47],"each":[49],"vertices.":[54],"The":[55,106,117],"detected":[58],"once":[59,98],"SDT":[61,85,100,118],"searches":[62],"its":[63,104],"corresponding":[64],"vertex.":[65],"There":[66],"may":[67],"be":[68],"some":[69],"non-recoverable":[70],"blockages":[72,80,112],"but":[76],"existence":[78],"to":[83,126],"initially.":[86],"If":[87],"blockage":[89],"exists":[90],"it":[94],"disclosed":[96],"visits":[101],"one":[102],"end-vertices.":[105],"graph":[107],"stays":[108],"connected":[109],"when":[110],"are":[113],"omitted":[114],"from":[115,120,149],"it.":[116],"begins":[119],"certain":[122],"aims":[125],"identify":[127],"route":[129],"without":[130,159,211],"any":[131],"blocked":[132],"edges":[133],"which":[134],"detects":[135],"with":[138,157,164,186,193],"minimum":[139],"total":[140],"traveling":[141],"cost.":[144],"analyze":[146],"this":[147],"problem":[148],"competitive":[151,174,190,201],"analysis":[152],"perspective":[153],"two":[155],"scenarios":[156],"blockages.":[160],"For":[161,208],"scenario":[163,210],"blockages,":[165,212],"we":[166,213],"provide":[167,214],"tight":[169,215],"lower":[170,194,216],"bound":[171],"ratio":[175,202],"deterministic":[177,181,222],"solutions,":[178],"optimal":[180,205,221],"solution,":[182],"randomized":[184,206,224],"solution":[185],"expected":[189,200],"ratio,":[191],"together":[192],"upper":[196],"bounds":[197,217],"solutions.":[207,225],"as":[218,220],"well":[219]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}