 
Summary: Independent Sets in Hypergraphs with
Applications to Routing Via Fixed Paths
Noga Alon 1 , Uri Arad 2 , and Yossi Azar 3
1 Department of Mathematics and Computer Science, TelAviv University.
noga@math.tau.ac.il
y
2 Dept. of Computer Science, TelAviv University, TelAviv, 69978, Israel.
uria@math.tau.ac.il
3 Dept. of Computer Science, TelAviv University, TelAviv, 69978, Israel.
azar@math.tau.ac.il
z
Abstract. The problem of finding a large independent set in a hyper
graph by an online algorithm is considered. We provide bounds for the
best possible performance ratio of deterministic vs. randomized and non
preemptive vs. preemptive algorithms. Applying these results we prove
bounds for the performance of online algorithms for routing problems
via fixed paths over networks.
1 Introduction
The problem of finding the maximum independent set in a graph is a funda
mental problem in Graph Theory and Theoretical Computer Science. It is well
