{"id":"https://openalex.org/W2139472392","doi":"https://doi.org/10.5555/365411.365786","title":"Optimal constrained graph exploration","display_name":"Optimal constrained graph exploration","publication_year":2001,"publication_date":"2001-01-09","ids":{"openalex":"https://openalex.org/W2139472392","doi":"https://doi.org/10.5555/365411.365786","mag":"2139472392"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.2374","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.2374","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~kumar/search.ps","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W2139472392"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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,"observed_orcids":[]},"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":["Department of Computer Science, University of Miami,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Miami,","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","observed_orcids":["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 Kobourov","raw_affiliation_strings":["Department of Computer Science, University of Arizona,#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-0477-2724","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Arizona,#TAB#","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035909718","display_name":"Vinit Kumar","orcid":"https://orcid.org/0000-0003-3253-5643","observed_orcids":["https://orcid.org/0000-0003-3253-5643"]},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vinit Kumar","raw_affiliation_strings":["Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#"],"raw_orcid":"https://orcid.org/0000-0003-3253-5643","affiliations":[{"raw_affiliation_string":"Max-Planck Institut F\u00fcr Informatik, Saarbr\u00fccken, Germany#TAB#","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4727,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.80216383,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"807","last_page":"814"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.00570000009611249,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.003599999938160181,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/graph-exploration","display_name":"graph exploration","score":0.9340000152587891},{"id":"https://openalex.org/keywords/tethered-robots","display_name":"tethered robots","score":0.9300000071525574},{"id":"https://openalex.org/keywords/unknown-graphs","display_name":"unknown graphs","score":0.6919999718666077},{"id":"https://openalex.org/keywords/optimal-algorithms","display_name":"optimal algorithms","score":0.5920000076293945},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.5040000081062317},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.5929999947547913},{"id":"https://openalex.org/keywords/robot-navigation","display_name":"robot navigation","score":0.35100001096725464}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.729698896408081},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5507831573486328},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5143888592720032},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4686146378517151},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.43458032608032227},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4280533790588379},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.4217371940612793},{"id":"https://openalex.org/C162269090","wikidata":"https://www.wikidata.org/wiki/Q1156047","display_name":"Rope","level":2,"score":0.4204747974872589},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4158346951007843},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3758523166179657},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37536028027534485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3698614835739136},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.2237500250339508},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21631014347076416},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.09769850969314575},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09167510271072388},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.2374","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.2374","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~kumar/search.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.26.4559","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.4559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.arizona.edu/people/kobourov/dkk-ocge-00.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.699.9954","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.9954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.i1.informatik.uni-bonn.de/lib/exe/fetch.php?media%3Dlehre%3Aws1314%3Aonline-motion-planning%3Afulltetheredrobot_0.pdf","raw_type":"text"},{"id":"mag:2139472392","doi":"https://doi.org/10.5555/365411.365786","is_oa":false,"landing_page_url":"https://arizona.pure.elsevier.com/en/publications/optimal-constrained-graph-exploration-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1512077559","https://openalex.org/W1873892361","https://openalex.org/W1971116024","https://openalex.org/W1983655539","https://openalex.org/W1992876208","https://openalex.org/W2019755546","https://openalex.org/W2050185335","https://openalex.org/W2051006450","https://openalex.org/W2067883046","https://openalex.org/W2099556589","https://openalex.org/W2120812773","https://openalex.org/W2126572568","https://openalex.org/W2140606869","https://openalex.org/W2149888497","https://openalex.org/W2154255883","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W2051006450","https://openalex.org/W43987413","https://openalex.org/W1980155648","https://openalex.org/W1512077559","https://openalex.org/W2126055967","https://openalex.org/W104304532","https://openalex.org/W7132833851","https://openalex.org/W2610059431","https://openalex.org/W7095185117"],"abstract_inverted_index":{"We":[0,131],"address":[1],"the":[2,34,44,46,52,55,65,70,77,85,90,100,118,123,129,141,168],"problem":[3,119,148],"of":[4,31,43,54,96,112,117,125,149],"exploring":[5],"an":[6,133],"unknown":[7],"graph":[8,142],"G":[9],"=":[10],"(V;":[11],"E)":[12],"from":[13,84,167],"a":[14,21,25,28,37,93,136,152,155,164,175],"given":[15],"start":[16,86],"node":[17,87],"s":[18,105],"with":[19,27,154,163],"either":[20],"tethered":[22,66,137,169],"robot":[23,26,47,67,78,101,138,153,170],"or":[24],"fuel":[29,94,157],"tank":[30,95,158],"limited":[32,156],"capacity,":[33],"former":[35],"being":[36],"tighter":[38],"constraint.":[39],"In":[40,64,89],"both":[41,115],"varaitations":[42],"problem,":[45],"can":[48,160],"only":[49],"move":[50],"along":[51],"edges":[53,126],"graph,":[56],"i.e,":[57],"it":[58],"cannot":[59],"jump":[60],"between":[61],"non-adjacent":[62],"vertices.":[63],"case,":[68],"if":[69],"tether":[71],"(rope)":[72],"has":[73],"length":[74],"l,":[75],"then":[76],"must":[79],"remain":[80],"within":[81],"distance":[82],"l":[83],"s.":[88],"second":[91],"variation,":[92],"capacity":[97,159],"C":[98,108],"forces":[99],"to":[102,104],"return":[103],"after":[106],"traversing":[107],"edges.":[109],"The":[110,147],"eciency":[111],"algorithms":[113],"for":[114,135],"variations":[116],"is":[120],"measured":[121],"by":[122],"number":[124],"traversed":[127],"during":[128],"exploration.":[130],"present":[132],"algorithm":[134],"which":[139],"explores":[140],"in":[143],"O(jEj)":[144,176],"edge":[145],"traversals.":[146],"exploration":[150],"using":[151],"be":[161],"solved":[162],"simple":[165],"reduction":[166],"case":[171],"and":[172],"also":[173],"yields":[174],"algorithm...":[177]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}