Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths

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]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1990, BIT.

[2]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[3]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[4]  Ran Canetti,et al.  Bandwidth allocation with preemption , 1995, STOC '95.

[5]  Moti Yung,et al.  Efficient On-Line Call Control Algorithms , 1997, J. Algorithms.

[6]  Yossi Azar,et al.  Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms , 1999, SODA '99.

[7]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[8]  Carsten Lund,et al.  Proof verification and the intractability of approximation problems , 1992, FOCS 1992.

[9]  Sandy Irani,et al.  Bounding the power of preemption in randomized scheduling , 1995, STOC '95.

[10]  Noga Alon,et al.  Approximating the independence number via theϑ-function , 1998, Math. Program..

[11]  Amos Fiat,et al.  Competitive non-preemptive call control , 1994, SODA '94.

[12]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

[13]  Amos Fiat,et al.  Lower bounds for on-line graph problems with application to on-line circuit and optical routing , 1996, STOC '96.

[14]  Jozef Gruska,et al.  Mathematical Foundations of Computer Science 1998 , 1998, Lecture Notes in Computer Science.

[15]  Stefano Leonardi,et al.  On-line Network Routing , 1996, Online Algorithms.

[16]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[17]  Yuval Rabani,et al.  On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[18]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[19]  Y. Mansour,et al.  Eecient On-line Call Control Algorithms , 1993 .

[20]  Hanno Lefmann,et al.  Approximating Maximum Independent Sets in Uniform Hypergraphs , 1998, MFCS.