On-line vertex-covering

Theoretical Computer Science

Volumn 332, Issue 1-3, 2005, Pages 83-108

  Demange, Marc ^a,b   Paschos, Vangelis Th ^c  

^a ESSEC BUSINESS SCHOOL   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^c UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation; Competitive ratio; Graph; On line algorithm; Vertex covering

Indexed keywords

APPROXIMATION THEORY; DATA ACQUISITION; DECISION MAKING; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

CLUSTER-MODEL; COMPETITIVE RATIO; ON-LINE ALGORITHMS; VERTEX-COVERING;

ONLINE SYSTEMS;

EID: 13644263500     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.08.015     Document Type: Article

References (13)

1. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo Algorithms for the on-line traveling salesman problem Algorithmica 29 4 2001 560 581
2. R. Bar-Yehuda, and S. Even A local-ratio theorem for approximating the weighted vertex cover problem Ann. Discrete Appl. Math. 25 1985 27 46
3. C. Berge Graphs and Hypergraphs 1973 North-Holland Amsterdam
4. M. Demange, X. Paradon, V. T. Paschos, On-line maximum-order induced hereditary subgraph problems, in: V. Hlaváč, K.G. Jeffery, J. Wiedermann (Eds.), SOFSEM 2000 - Theory and Practice of Informatics, Lecture Notes in Computer Science, Vol. 1963, Springer, Berlin, 2000, pp. 326-334.
5. R. El-Yaniv, A. Fiat, R.E. Karp, G.Turpin, Competitive analysis of financial games, in: Proc. FOCS'92, 1992, pp. 327-333.
6. A. Fiat, G. Wœginger (Eds.), Online Algorithms: The State of the Art, Lecture Notes in Computer Science, Vol. 1442, Springer, Berlin, 1998.
7. A. Gyárfás, and J. Lehel Online and first-fit colorings of graphs J. Graph Theory 12 1988 217 227
8. M.M. Halldórsson, K. Iwama, S. Miyazaki, and S. Taketomi Online independent sets Theoret. Comput. Sci. 289 2 2002 953 962
9. M.M. Halldórsson, and M. Szegedy Lower bounds for on-line graph coloring Theoret. Comput. Sci. 130 1 1994 163 174
10. S. Irani, and A.R. Karlin Online computation D.S. Hochbaum Approximation Algorithms for NP-hard Problems 1997 PWS Publishing Company MA 521 565 (Chapter 13)
11. L. Lovász, M. Saks, and W. Trotter An on-line graph coloring algorithm with sublinear performance ratio Discrete Math. 75 1-3 1989 319 325
12. C.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization Algorithms and Complexity 1981 Prentice-Hall Englewood Cliffs, NJ
13. D. Sleator, and R.E. Tarjan Amortized efficiency of list update and paging rules Commun. ACM 28 2 1985 202 208