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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adler, R., Azar, Y.: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In: Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, pp. 1–10 (1999)
Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive online routing. In: 34th IEEE Symposium on Foundations of Computer Science, pp. 32–40 (1993)
Alon, N., Kahale, N.: Approximating the independence number via the 0-function. Math. Programming 80, 253–264 (1998)
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and intractability of approximation problems. In: Proc. of the 33rd IEEE FOCS, pp. 14–23. IEEE, Los Alamitos (1992)
Awerbuch, B., Bartal, Y., Fiat, A., Rosén, A.: Competitive non-preemptive call control. In: Proc. of 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 312–320 (1994)
Awerbuch, B., Gawlick, R., Leighton, T., Rabani, Y.: On-line admission control and circuit routing for high performance computation and communication. In: Proc. 35th IEEE Symp. on Found. of Comp. Science, pp. 412–423 (1994)
Bar-Noy, A., Canetti, R., Kutten, S., Mansour, Y., Schieber, B.: Bandwidth allocation with preemption. In: Proc. 27th ACM Symp. on Theory of Computing, pp. 616–625 (1995)
Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In: Proc. 28th ACM Symp. on Theory of Computing, pp. 531–540 (1996)
Berger, B., Rompel, J.: A better performance guarantee for approximate graph coloring. Algorithmica 5, 459–466 (1990)
Boppana, R., Halldorsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT 32, 180–196 (1992)
Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)
Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. In: Proc. 27th ACM Symp. on Theory of Computing, pp. 606–615 (1995)
Garay, J.A., Gopal, I.S.: Call preemption in communication networks. In: Proceedings of INFOCOM 1992, Florence, Italy, vol. 44, pp. 1043–1050 (1992)
Garay, J., Gopal, I., Kutten, S., Mansour, Y., Yung, M.: Efficient on-line call control algorithms. Journal of Algorithms 23, 180–194 (1997)
Leonardi, S.: On-line network routing. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms - The State of the Art, pp. 242–267. Springer, Heidelberg (1998)
Håstad, J.: Clique is hard to approximate within n1’6. In: Proc. 37th IEEE FOCS, pp. 627–636. IEEE, Los Alamitos (1996)
Hofmeister, T., Lefmann, H.: Approximating maximum independent sets in uniform hypergraphs. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 562–570. Springer, Heidelberg (1998)
Karp, R.: Reducibility among combinatorial problems. In: Miller, Thatcher (eds.) Plenum Press, New York (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alon, N., Arad, U., Azar, Y. (1999). Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds) Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 1999 1999. Lecture Notes in Computer Science, vol 1671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48413-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-48413-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66329-4
Online ISBN: 978-3-540-48413-4
eBook Packages: Springer Book Archive