{"id":"https://openalex.org/W2171330236","doi":"https://doi.org/10.1137/s0097539795279943","title":"Competitive Algorithms for Layered Graph Traversal","display_name":"Competitive Algorithms for Layered Graph Traversal","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2171330236","doi":"https://doi.org/10.1137/s0097539795279943","mag":"2171330236"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795279943","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795279943","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/A5038118929","display_name":"Amos Fiat","orcid":"https://orcid.org/0000-0002-5748-9519"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Amos Fiat","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112767220","display_name":"Dean P. Foster","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dean P. Foster","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087578885","display_name":"Howard Karloff","orcid":"https://orcid.org/0000-0003-4490-2324"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Howard Karloff","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010842984","display_name":"Yuval Rabani","orcid":"https://orcid.org/0000-0001-7772-2544"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuval Rabani","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077052389","display_name":"Yiftach Ravid","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yiftach Ravid","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5053966865","display_name":"Sundar Vishwanathan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sundar Vishwanathan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5038118929"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5112,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.76408217,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"28","issue":"2","first_page":"447","last_page":"462"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9840999841690063,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9818000197410583,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.782788872718811},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7718619704246521},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.7573680877685547},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6798532605171204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5920038223266602},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.5622056126594543},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5407910346984863},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5185761451721191},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5068674683570862},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49012646079063416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48502108454704285},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.45061931014060974},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4161588251590729}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.782788872718811},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7718619704246521},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.7573680877685547},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6798532605171204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5920038223266602},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.5622056126594543},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5407910346984863},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5185761451721191},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5068674683570862},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49012646079063416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48502108454704285},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.45061931014060974},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4161588251590729},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539795279943","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795279943","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1966160207","https://openalex.org/W1970647593","https://openalex.org/W1979235091","https://openalex.org/W1981660486","https://openalex.org/W1992876208","https://openalex.org/W2007572995","https://openalex.org/W2019729116","https://openalex.org/W2041645394","https://openalex.org/W2054033098","https://openalex.org/W2056760235","https://openalex.org/W2082099352","https://openalex.org/W2114538202","https://openalex.org/W2157650361","https://openalex.org/W2160365857","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W4252986459"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4230405657","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W170547082","https://openalex.org/W2136735429"],"abstract_inverted_index":{"A":[0],"layered":[1,35,46,93,149,155],"graph":[2,6,36,47,94,150],"is":[3,30,104,137,185],"a":[4,39,45,55,99,116,121,138,165,170,175,189],"connected":[5],"whose":[7,17],"vertices":[8,61],"are":[9,73],"partitioned":[10],"into":[11],"sets":[12],"L0=s,":[13],"L1,":[14],"L2,...,":[15],"and":[16,51,65,71,85,109,181],"edges,":[18],"which":[19,103],"have":[20,120],"nonnegative":[21],"integral":[22],"weights,":[23],"run":[24],"between":[25,68],"consecutive":[26],"layers.":[27],"Its":[28],"width":[29,50],"$\\max\\{|L_i|\\}$.":[31],"In":[32],"the":[33,60,66,77,89,142],"on-line":[34,101,118,148,172],"traversal":[37,95,151],"problem,":[38],"searcher":[40,78],"starts":[41],"at":[42,164],"s":[43],"in":[44,62],"of":[48,92,145,158,178],"unknown":[49],"tries":[52],"to":[53,188],"reach":[54],"target":[56],"vertex":[57],"t;":[58],"however,":[59],"layer":[63,80],"i":[64,72],"edges":[67],"layers":[69],"i-1":[70],"only":[74],"revealed":[75],"when":[76],"reaches":[79],"i-1.":[81],"We":[82,97,130],"give":[83,98,169],"upper":[84],"lower":[86,139],"bounds":[87],"on":[88,106,127,141],"competitive":[90,122,143,176],"ratio":[91,123,144,177],"algorithms.":[96],"deterministic":[100,117],"algorithm":[102,119,173],"O(9w)-competitive":[105],"width-w":[107,128],"graphs":[108,156],"prove":[110,131,182],"that":[111,132,183],"for":[112,133],"no":[113],"w":[114,159],"can":[115],"better":[124],"than":[125],"2w-2":[126],"graphs.":[129],"all":[134],"w,":[135],"w/2":[136],"bound":[140],"any":[146],"randomized":[147,171],"algorithm.":[152],"For":[153],"traversing":[154],"consisting":[157],"disjoint":[160],"paths":[161],"tied":[162],"together":[163],"common":[166],"source,":[167],"we":[168],"with":[174],"O(log":[179],"w)":[180],"this":[184],"optimal":[186],"up":[187],"constant":[190],"factor.":[191]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"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"}