{"id":"https://openalex.org/W1993447512","doi":"https://doi.org/10.1137/s0097539702419352","title":"An Optimal Competitive Strategy for Walking in Streets","display_name":"An Optimal Competitive Strategy for Walking in Streets","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1993447512","doi":"https://doi.org/10.1137/s0097539702419352","mag":"1993447512"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539702419352","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702419352","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5060426722","display_name":"Christian Icking","orcid":null},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"University of Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christian Icking","raw_affiliation_strings":["Praktische Informatik VI, FernUniversit\u00e4t Hagen, Hagen,"],"affiliations":[{"raw_affiliation_string":"Praktische Informatik VI, FernUniversit\u00e4t Hagen, Hagen,","institution_ids":["https://openalex.org/I120691247"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109226564","display_name":"Rolf Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"University of Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Klein","raw_affiliation_strings":["Praktische Informatik VI, FernUniversit\u00e4t Hagen, Hagen,"],"affiliations":[{"raw_affiliation_string":"Praktische Informatik VI, FernUniversit\u00e4t Hagen, Hagen,","institution_ids":["https://openalex.org/I120691247"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058265992","display_name":"Elmar Langetepe","orcid":null},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"University of Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Elmar Langetepe","raw_affiliation_strings":["Praktische Informatik VI, FernUniversit\u00e4t Hagen, Hagen,"],"affiliations":[{"raw_affiliation_string":"Praktische Informatik VI, FernUniversit\u00e4t Hagen, Hagen,","institution_ids":["https://openalex.org/I120691247"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058227744","display_name":"Sven Schuierer","orcid":"https://orcid.org/0000-0003-1659-0941"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sven Schuierer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030168508","display_name":"Ines Semrau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ines Semrau","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5060426722"],"corresponding_institution_ids":["https://openalex.org/I120691247"],"apc_list":null,"apc_paid":null,"fwci":0.927,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.79482414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"33","issue":"2","first_page":"462","last_page":"486"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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.9969000220298767,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/simple-polygon","display_name":"Simple polygon","score":0.667664647102356},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6492334008216858},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5502630472183228},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5359441041946411},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4474567472934723},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4374420940876007},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.42217564582824707},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41084954142570496},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3513210415840149},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.12232831120491028},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.09408873319625854},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08593809604644775}],"concepts":[{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.667664647102356},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6492334008216858},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5502630472183228},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5359441041946411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4474567472934723},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4374420940876007},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.42217564582824707},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41084954142570496},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3513210415840149},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.12232831120491028},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.09408873319625854},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08593809604644775},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539702419352","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702419352","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W34767548","https://openalex.org/W50228681","https://openalex.org/W141423351","https://openalex.org/W143413539","https://openalex.org/W183221052","https://openalex.org/W1480871931","https://openalex.org/W1486104780","https://openalex.org/W1501957312","https://openalex.org/W1507457224","https://openalex.org/W1512794094","https://openalex.org/W1522189287","https://openalex.org/W1538329849","https://openalex.org/W1555471913","https://openalex.org/W1559701472","https://openalex.org/W1571687484","https://openalex.org/W1573346665","https://openalex.org/W1578733216","https://openalex.org/W1597251915","https://openalex.org/W1597555068","https://openalex.org/W1605945225","https://openalex.org/W1966360761","https://openalex.org/W1967507886","https://openalex.org/W1993450089","https://openalex.org/W2007762629","https://openalex.org/W2019729116","https://openalex.org/W2027689366","https://openalex.org/W2041645394","https://openalex.org/W2075002099","https://openalex.org/W2088357751","https://openalex.org/W2095383780","https://openalex.org/W2121105392","https://openalex.org/W2159175077","https://openalex.org/W2165780346","https://openalex.org/W2175742361","https://openalex.org/W2217504651","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W3014595637","https://openalex.org/W2987051945","https://openalex.org/W53644101","https://openalex.org/W2154329468","https://openalex.org/W2389833224","https://openalex.org/W1571990143","https://openalex.org/W2372903818","https://openalex.org/W1567510565"],"abstract_inverted_index":{"A":[0],"simple":[1],"polygon":[2],"P":[3],"with":[4],"two":[5,17,91],"distinguished":[6],"vertices,":[7],"s":[8,21,36],"and":[9,63,79,87,99,124,127],"t,":[10,38],"is":[11],"called":[12],"a":[13,44,151],"street":[14],"if":[15],"the":[16,52,57,69,83,89,104,132],"boundary":[18],"chains":[19],"from":[20,35],"to":[22,37],"t":[23],"are":[24],"mutually":[25],"weakly":[26],"visible.":[27],"We":[28],"present":[29,148],"an":[30,65],"on-line":[31],"strategy":[32],"that":[33],"walks":[34],"in":[39,68,110,115],"any":[40],"unknown":[41],"street,":[42],"on":[43,107,135],"path":[45,73],"at":[46,145],"most":[47],"$\\sqrt{2}$":[48],"times":[49],"longer":[50],"than":[51],"shortest":[53],"path.":[54],"This":[55],"matches":[56],"best":[58],"lower":[59],"bound":[60],"previously":[61],"known":[62],"settles":[64],"open":[66],"problem":[67],"area":[70],"of":[71,103,131,138],"competitive":[72],"planning.":[74],"(The":[75],"result":[76],"was":[77],"simultaneously":[78],"independently":[80],"obtained":[81],"by":[82,88],"first":[84],"three":[85],"authors":[86],"last":[90],"authors.":[92],"Both":[93],"papers,":[94],"[C.":[95],"Icking,":[96],"R.":[97],"Klein,":[98],"E.":[100],"Langetepe,":[101],"Proceedings":[102,130],"16th":[105,133],"Symposium":[106,134],"Theoretical":[108,136],"Aspects":[109,137],"Computer":[111,139],"Science,":[112,140],"Lecture":[113],"Notes":[114],"Comput.":[116],"Sci.":[117],"1563,":[118],"Springer-Verlag,":[119],"Berlin,":[120],"1999,":[121],"pp.":[122,141],"110--120]":[123],"[S.":[125],"Schuierer":[126],"I.":[128],"Semrau,":[129],"121--131],":[142],"were":[143],"presented":[144],"STACS'99.":[146],"The":[147],"paper":[149],"contains":[150],"joint":[152],"full":[153],"version.)":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}