Independent sets in hypergraphs with applications to routing via fixed paths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1671, Issue , 1999, Pages 16-27

  Alon, Noga ^a   Arad, Uri ^a   Azar, Yossi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; OPTIMIZATION; RANDOM PROCESSES;

HYPER GRAPH; INDEPENDENT SET; NON-PREEMPTIVE; ON-LINE ALGORITHMS; PERFORMANCE RATIO; PREEMPTIVE ALGORITHM; ROUTING PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 84958739386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_3     Document Type: Conference Paper

References (18)

1. R. Adler and Y. Azar, Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms, Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 1-10.
2. B. Awerbuch, Y. Azar, and S. Plotkin, Throughput-competitive online routing, 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 32-40.
3. N. Alon and N. Kahale, Approximating the independence number via the θ-function, Math. Programming 80 (1998), 253-264.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, Proc. of the 33rd IEEE FOCS, IEEE (1992), pages 14-23.
5. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén, Competitive non-preemptive call control, Proc. of 5th ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 312-320.
6. B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani, On-line admission control and circuit routing for high performance computation and communication, Proc. 35th IEEE Symp. on Found. of Comp. Science, 1994, pp. 412-423.
7. A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber, Bandwidth allocation with preemption, Proc. 27th ACM Symp. on Theory of Computing, 1995, pp. 616-625.
8. Y. Bartal, A. Fiat, and S. Leonardi, Lower bounds for on-line graph problems with application to on-line circuit and optical routing, Proc. 28th ACM Symp. on Theory of Computing, 1996, pp. 531-540.
9. B. Berger and J. Rompel, A better performance guarantee for approximate graph coloring, Algorithmica 5(1990),459-466.
10. [10] R. Boppana and M. M. Halldorsson, Approximating maximum independent sets by excluding subgraphs, BIT 32 (1992), 180-196.
11. [11] A. Borodin and R. El-Yaniv, Online computation and competitive analysis, Cambridge University Press, 1998.
12. [12] R. Canetti and S. Irani, Bounding the power of preemption in randomized scheduling, Proc. 27th ACM Symp. on Theory of Computing, 1995, pp. 606-615.
13. [13] J.A. Garay and I.S. Gopal, Call preemption in communication networks, Proceedings of INFOCOM’92 (Florence, Italy), vol. 44, 1992, pp. 1043-1050.
14. [14] J. Garay, I. Gopal, S. Kutten, Y. Mansour, and M. Yung, Efficient on-line call control algorithms, Journal of Algorithms 23 (1997), 180-194.
15. [15] S. Leonardi, On-line network routing, Online Algorithms-The State of the Art (A. Fiat and G. Woeginger, eds.), Springer, 1998, pp. 242-267.
16. 1-ε, Proc. 37th IEEE FOCS, IEEE (1996), 627-636.
17. [17] T. Hofmeister and H. Lefmann, Approximating maximum independent sets in uniform hypergraphs, Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1450, Springer Verlag (1998), 562-570.
18. [18] R. Karp, Reducibility among combinatorial problems, Plenum Press, New York, 1972, Miller and Thatcher (eds).