Naveen Sivadasan

Randomized Pursuit-Evasion in Graphs

We analyse a randomized pursuit-evasion game played by two players on a graph, a hunter and a rabbit. Let

Online scheduling with bounded migration

G

Topology matters: smoothed competitiveness of metrical task systems

be any connected, undirected graph with

Energy Optimal Routing in Radio Networks Using Geometric Data Structures

n

All-pairs shortest-paths computation in the presence of negative cycles

nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node or move to another node. The hunter is assumed to be restricted to the graph

Topology Matters: Smoothed Competitiveness of Metrical Task Systems

G

Topology Matters: Smoothed Competitiveness of Metrical Task Systems.

: in every round, the hunter can move using at most one edge. For the rabbit we investigate two models: in one model the rabbit is restricted to the same graph as the hunter, and in the other model the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round.We say that the rabbit is caught as soon as hunter and rabbit are located at the same node in a round. The goal of the hunter is to catch the rabbit in as few rounds as possible, whereas the rabbit aims to maximize the number of rounds until it is caught. Given a randomized hunter strategy for

Online Scheduling with Bounded Migration

G

ONLINE SCHEDULING WITH BOUNDED MIGRATION (EXTENDED ABSTRACT FOR DAGSTUHL SEMINAR 05031 ON ALGORITHMS FOR OPTIMIZATION WITH INCOMPLETE INFORMATION)

, the escape length for that strategy is the worst case expected number of rounds it takes the hunter to catch the rabbit, where the worst case is with regard to all (possibly randomized) rabbit strategies. Our main result is a hunter strategy for general graphs with an escape length of only

Topology matters: Smoothed competitiveness of metrical task systems

O(n log (diam(G)))