Graph-theoretic game and its application to the k-server problem

SIAM Journal on Computing

Volumn 24, Issue 1, 1995, Pages 78-100

  Alon, Noga ^a   Karp, Richard M ^a   Peleg, David ^a   West, Douglas ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CHEBYSHEV APPROXIMATION; DESIGN; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

AVERAGE STRETCH; EDGE PLAYER; K SERVERS; RANDOMIZED ALGORITHM; ROAD NETWORK; SPANNERS; SPANNING TREES; TREE PLAYER; WEIGHTED CONNECTED GRAPH; ZERO SUM GAME;

GAME THEORY;

EID: 0029249995     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792224474     Document Type: Article

References (19)