Online independent sets

Theoretical Computer Science

Volumn 289, Issue 2, 2002, Pages 953-962

  Halldórsson, Magnús M ^a   Iwama, Kazuo ^b   Miyazaki, Shuichi ^b   Taketomi, Shiro ^b  

^a UNIVERSITY OF ICELAND   (Iceland)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

Competitive ratio; Independent set problem; Online algorithms

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

ONLINE ALGORITHMS;

COMPUTER SCIENCE;

EID: 0037202046     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00411-X     Document Type: Conference Paper

References (10)

1. Bean D. Effective coloration. J. Symbolic Logic. 41:1976;469-480.
2. Golumbic M. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
3. Gyárfás A., Lehel J. On-line and first fit colorings of graphs. J. Graph Theory. 12(2):1988;217-227.
4. M.M. Halldórsson, Online coloring known graphs, Electron. J. Combin. 7 (R6) (2000). http://www.combinatorics.org
5. Halldórsson M.M., Szegedy M. Lower bounds for on-line graph coloring. Theoret. Comput. Sci. 130:1994;163-174.
6. Kierstead H.A. On-line coloring. k -colorable graphs Israel J. Math. 105:1998;93-104.
7. Kierstead H.A., Trotter W.T. An extremal problem in recursive combinatorics. Congr. Numer. 33:1981;143-153.
8. R.J. Lipton, A. Tomkins, Online interval scheduling, Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 302-311.
9. Lovász L., Saks M., Trotter W.T. An online graph coloring algorithm with sublinear performance ratio. Discrete Math. 75:1989;319-325.
10. A. Yao, Probabilistic computations: towards a unified measure of complexity, Proc. 18th Ann. IEEE Symp. on Foundations of Computer Science, 1977, 535-542.