{"id":"https://openalex.org/W4401141840","doi":"https://doi.org/10.1007/s10878-024-01192-0","title":"An improved upper bound for the online graph exploration problem on unicyclic graphs","display_name":"An improved upper bound for the online graph exploration problem on unicyclic graphs","publication_year":2024,"publication_date":"2024-07-29","ids":{"openalex":"https://openalex.org/W4401141840","doi":"https://doi.org/10.1007/s10878-024-01192-0"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-024-01192-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01192-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-024-01192-0.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-024-01192-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111911034","display_name":"Koji Kobayashi","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Koji M. Kobayashi","raw_affiliation_strings":["The University of Tokyo, 3-8-1 Komaba, Meguro-ku, Tokyo, 113-8902, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo, 3-8-1 Komaba, Meguro-ku, Tokyo, 113-8902, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052672374","display_name":"Yinghong Li","orcid":"https://orcid.org/0000-0003-3629-519X"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ying Li","raw_affiliation_strings":["The University of Tokyo, 3-8-1 Komaba, Meguro-ku, Tokyo, 113-8902, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo, 3-8-1 Komaba, Meguro-ku, Tokyo, 113-8902, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111911034"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.3663,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.59564072,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"48","issue":"1","first_page":null,"last_page":null},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"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/T11182","display_name":"Auction Theory and Applications","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7775580883026123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5424535870552063},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5315836071968079},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5269345045089722},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5151835680007935},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.4726744592189789},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.46237704157829285},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38090062141418457},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.34866616129875183},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.3125603497028351},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2641505002975464}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7775580883026123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5424535870552063},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5315836071968079},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5269345045089722},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5151835680007935},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.4726744592189789},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.46237704157829285},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38090062141418457},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.34866616129875183},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3125603497028351},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2641505002975464},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-024-01192-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01192-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-024-01192-0.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:RePEc:spr:jcomop:v:48:y:2024:i:1:d:10.1007_s10878-024-01192-0","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-024-01192-0","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-024-01192-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01192-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-024-01192-0.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":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320315052","display_name":"Meiji University","ror":"https://ror.org/02rqvrp93"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4401141840.pdf"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W105334049","https://openalex.org/W1552828154","https://openalex.org/W1588736092","https://openalex.org/W1884349932","https://openalex.org/W1999053910","https://openalex.org/W2011318188","https://openalex.org/W2032799093","https://openalex.org/W2041645394","https://openalex.org/W2065818036","https://openalex.org/W2084346109","https://openalex.org/W2111972027","https://openalex.org/W2903188967","https://openalex.org/W2956015669","https://openalex.org/W3017016309","https://openalex.org/W3036524578","https://openalex.org/W3136290985","https://openalex.org/W3153676396","https://openalex.org/W4292845823"],"related_works":["https://openalex.org/W2982283786","https://openalex.org/W3193236920","https://openalex.org/W4288436438","https://openalex.org/W4213419526","https://openalex.org/W1995383828","https://openalex.org/W4298388358","https://openalex.org/W1858680408","https://openalex.org/W4246526124","https://openalex.org/W4298172984","https://openalex.org/W4309222715"],"abstract_inverted_index":{"Abstract":[0],"The":[1,62],"online":[2,80,114,160],"graph":[3,28],"exploration":[4],"problem":[5,66],",":[6],"which":[7,53,90],"was":[8],"proposed":[9],"by":[10],"Kalyanasundaram":[11],"and":[12,29],"Pruhs":[13],"(Theor":[14,131],"Comput":[15,132],"Sci":[16,133],"130(1):125\u2013138,":[17],"1994),":[18],"is":[19,42,67,116,162],"defined":[20],"as":[21],"follows:":[22],"Given":[23],"an":[24,40,79,113,159],"edge-weighted":[25],"undirected":[26],"connected":[27],"a":[30,45,71,137],"specified":[31],"vertex":[32],"(called":[33],"the":[34,37,48,51,56,59,65,84,109,125,143,155],"origin":[35,49,52],"),":[36],"task":[38],"of":[39,58,64,73,86,89,92,112,140,158],"algorithm":[41,81,115,161],"to":[43,50,68,98],"compute":[44],"path":[46,72],"from":[47],"contains":[54],"all":[55],"vertices":[57,94,96],"given":[60],"graph.":[61,123,149,169],"goal":[63],"find":[69],"such":[70],"minimum":[74],"weight.":[75],"At":[76],"each":[77,88],"time,":[78],"knows":[82],"only":[83],"weights":[85],"edges":[87],"consists":[91],"visited":[93,99],"or":[95],"adjacent":[97],"vertices.":[100],"Fritsch":[101],"(Inform":[102],"Process":[103],"Lett":[104],"168:1006096,":[105],"2021)":[106],"showed":[107,136,154],"that":[108],"competitive":[110,144,156],"ratio":[111,145,157],"at":[117,163],"most":[118,164],"three":[119],"for":[120,146,166],"any":[121,147,167],"unicyclic":[122,148,168],"On":[124],"other":[126],"hand,":[127],"Brandt":[128],"et":[129],"al.":[130],"839:176\u2013185,":[134],"2020)":[135],"lower":[138],"bound":[139],"two":[141],"on":[142],"In":[150],"this":[151],"paper,":[152],"we":[153],"5/2":[165]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}