To satisfy impatient web surfers is hard

DOI10.1016/j.tcs.2014.01.009zbMath1282.68082WikidataQ60488410 ScholiaQ60488410MaRDI QIDQ2437758

Fedor V. Fomin, Nicolas Nisse, Frederic Giroire, Alain Jean-Marie, Dorian Mazauric

Publication date: 13 March 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.009

zbMATH Keywords

prefetching; interval graphs; PSPACE-complete; cops and robber games

Mathematics Subject Classification ID

91A05: 2-person games

91A43: Games involving graphs

91A80: Applications of game theory

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68M11: Internet topics