{"id":"https://openalex.org/W2149735608","doi":"https://doi.org/10.1145/1159892.1159897","title":"Optimal constrained graph exploration","display_name":"Optimal constrained graph exploration","publication_year":2006,"publication_date":"2006-07-01","ids":{"openalex":"https://openalex.org/W2149735608","doi":"https://doi.org/10.1145/1159892.1159897","mag":"2149735608"},"language":"en","primary_location":{"id":"doi:10.1145/1159892.1159897","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1159892.1159897","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5113650837","display_name":"Christian A. Duncan","orcid":null},"institutions":[{"id":"https://openalex.org/I145608581","display_name":"University of Miami","ror":"https://ror.org/02dgjyy92","country_code":"US","type":"education","lineage":["https://openalex.org/I145608581"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christian A. Duncan","raw_affiliation_strings":["University of Miami, Miami, FL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Miami, Miami, FL","institution_ids":["https://openalex.org/I145608581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003147292","display_name":"Stephen Kobourov","orcid":"https://orcid.org/0000-0002-0477-2724"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen G. Kobourov","raw_affiliation_strings":["University of Arizona, Tucson, AZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Arizona, Tucson, AZ","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107858741","display_name":"V. S. Anil Kumar","orcid":"https://orcid.org/0000-0002-4406-8483"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V. S. Anil Kumar","raw_affiliation_strings":["Virginia Tech, Blacksburg, VA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, VA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1807,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.89385317,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"2","issue":"3","first_page":"380","last_page":"402"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9819999933242798,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.978600025177002,"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/robot","display_name":"Robot","score":0.718031108379364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.576827883720398},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5108025074005127},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4934805631637573},{"id":"https://openalex.org/keywords/rope","display_name":"Rope","score":0.47108137607574463},{"id":"https://openalex.org/keywords/jump","display_name":"Jump","score":0.4596710801124573},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43703708052635193},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.43323689699172974},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4215373992919922},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39065858721733093},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36462488770484924},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30576902627944946},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21147167682647705},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.20254051685333252}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.718031108379364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.576827883720398},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5108025074005127},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4934805631637573},{"id":"https://openalex.org/C162269090","wikidata":"https://www.wikidata.org/wiki/Q1156047","display_name":"Rope","level":2,"score":0.47108137607574463},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.4596710801124573},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43703708052635193},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.43323689699172974},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4215373992919922},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39065858721733093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36462488770484924},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30576902627944946},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21147167682647705},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.20254051685333252},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1159892.1159897","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1159892.1159897","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1971116024","https://openalex.org/W1979924144","https://openalex.org/W1983655539","https://openalex.org/W1989793404","https://openalex.org/W1992876208","https://openalex.org/W2008110774","https://openalex.org/W2008992746","https://openalex.org/W2017716370","https://openalex.org/W2019755546","https://openalex.org/W2027056835","https://openalex.org/W2047087577","https://openalex.org/W2050037634","https://openalex.org/W2067883046","https://openalex.org/W2075002099","https://openalex.org/W2075459377","https://openalex.org/W2077944048","https://openalex.org/W2095383780","https://openalex.org/W2099556589","https://openalex.org/W2120812773","https://openalex.org/W2126572568","https://openalex.org/W2132529817","https://openalex.org/W2137561762","https://openalex.org/W2139472392","https://openalex.org/W2140606869","https://openalex.org/W2149888497","https://openalex.org/W2154255883","https://openalex.org/W2752885492","https://openalex.org/W4240538936","https://openalex.org/W4241060902","https://openalex.org/W6680667059"],"related_works":["https://openalex.org/W2906841975","https://openalex.org/W2385671392","https://openalex.org/W2610737932","https://openalex.org/W2383129606","https://openalex.org/W2042289434","https://openalex.org/W2062262086","https://openalex.org/W2073908095","https://openalex.org/W2952342369","https://openalex.org/W4291863732","https://openalex.org/W2392841491"],"abstract_inverted_index":{"We":[0,139],"address":[1],"the":[2,39,49,51,57,60,71,76,84,92,98,108,126,131,137,149,178,193,211,215],"problem":[3,127,158],"of":[4,7,36,48,59,104,120,125,133,159,197],"constrained":[5],"exploration":[6,160,217],"an":[8,141],"unknown":[9],"graph":[10,150,216],"G":[11],"=":[12],"(":[13],"V":[14,204,208],",":[15,82],"E":[16,153,187,200,221],")":[17],"from":[18,91,177],"a":[19,26,30,33,42,101,144,162,165,174,185,228],"given":[20],"start":[21,93],"node":[22,94],"s":[23,95,113],"with":[24,32,164,173],"either":[25],"tethered":[27,72,145,179],"robot":[28,31,52,73,85,109,146,163,180],"or":[29],"fuel":[34,102,167],"tank":[35,103,168],"limited":[37,105,166],"capacity,":[38],"former":[40],"being":[41],"tighter":[43],"constraint.":[44],"In":[45,70,97],"both":[46,123],"variations":[47,124],"problem,":[50],"can":[53,170],"only":[54],"move":[55],"along":[56],"edges":[58,134],"graph,":[61],"for":[62,122,143,214],"example,":[63],"it":[64],"cannot":[65],"jump":[66],"between":[67],"nonadjacent":[68],"nodes.":[69],"case,":[74],"if":[75],"tether":[77],"(rope)":[78],"has":[79],"length":[80],"l":[81,90],"then":[83],"must":[86],"remain":[87],"within":[88,227],"distance":[89],".":[96],"second":[99],"variation,":[100],"capacity":[106,169],"forces":[107],"to":[110,112],"return":[111],"after":[114],"traversing":[115],"C":[116],"edges.":[117],"The":[118,157],"efficiency":[119],"algorithms":[121],"is":[128,219,225],"measured":[129],"by":[130],"number":[132],"traversed":[135],"during":[136],"exploration.":[138],"present":[140],"algorithm":[142,224],"that":[147],"explores":[148],"in":[151],"\u0398(|":[152,186],"|)":[154,188],"edge":[155],"traversals.":[156],"using":[161],"be":[171],"solved":[172],"simple":[175],"reduction":[176],"case":[181],"and":[182],"also":[183],"yields":[184],"algorithm.":[189],"This":[190],"improves":[191],"on":[192],"previous":[194],"best-known":[195],"bound":[196,213],"O":[198],"(|":[199],"|":[201,203,207],"+":[202],"|log":[205],"2":[206],"|).":[209],"Since":[210],"lower":[212],"problems":[218],"\u2126(|":[220],"|),":[222],"our":[223],"optimal":[226],"constant":[229],"factor.":[230]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}