Online Graph Coloring Against a Randomized Adversary
暂无分享,去创建一个
Elisabet Burjons | Juraj Hromkovic | Richard Královic | Walter Unger | Xavier Muñoz | Rastislav Kralovic | Rastislav Kralovic | J. Hromkovic | Walter Unger | Richard Královic | E. Burjons | X. Muñoz
[1] Dennis Komm. An Introduction to Online Computation: Determinism, Randomization, Advice , 2016 .
[2] András Gyárfás,et al. On-line and first fit colorings of graphs , 1988, J. Graph Theory.
[3] Christos H. Papadimitriou,et al. Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[4] Sundar Vishwanathan. Randomized Online Graph Coloring , 1992, J. Algorithms.
[5] Dennis Komm,et al. On the Advice Complexity of the Set Cover Problem , 2012, CSR.
[6] Dennis Komm,et al. The string guessing problem as a method to prove lower bounds on the advice complexity , 2013, Theor. Comput. Sci..
[7] Lucia Keller,et al. Online Coloring of Bipartite Graphs with and without Advice , 2012, Algorithmica.
[8] Dennis Komm,et al. The online knapsack problem: Advice and randomization , 2014, Theor. Comput. Sci..
[9] Michael E. Saks,et al. An on-line graph coloring algorithm with sublinear performance ratio , 1989, Discret. Math..
[10] Henry Kierstead,et al. Chapter 18 Recursive and on-line graph coloring , 1998 .
[11] Dennis Komm,et al. On the Advice Complexity of the k-Server Problem , 2011, ICALP.
[12] Stefan Dobrev,et al. Measuring the problem-relevant information in input , 2009, RAIRO Theor. Informatics Appl..
[13] Dennis Komm,et al. Advice Complexity and Barely Random Algorithms , 2011, RAIRO Theor. Informatics Appl..
[14] Daniël Paulusma,et al. A New Algorithm for On-line Coloring Bipartite Graphs , 2008, SIAM J. Discret. Math..