Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract)
暂无分享,去创建一个
Elisabet Burjons | Juraj Hromkovic | Walter Unger | Xavier Muñoz | J. Hromkovic | Walter Unger | E. Burjons | X. Muñoz
[1] Dennis Komm,et al. Advice Complexity and Barely Random Algorithms , 2011, RAIRO Theor. Informatics Appl..
[2] Lucia Keller,et al. Online Coloring of Bipartite Graphs with and without Advice , 2012, Algorithmica.
[3] Stefan Dobrev,et al. Measuring the problem-relevant information in input , 2009, RAIRO Theor. Informatics Appl..
[4] Dennis Komm,et al. Disjoint Path Allocation with Sublinear Advice , 2015, COCOON.
[5] Dennis Komm,et al. On the Advice Complexity of Online Problems , 2009, ISAAC.
[6] David Wehner,et al. Advice Complexity of Fine-Grained Job Shop Scheduling , 2015, CIAC.
[7] Juraj Hromkovic,et al. Information Complexity of Online Problems , 2010, MFCS.
[8] Dennis Komm,et al. On the Advice Complexity of the k-Server Problem , 2011, ICALP.
[9] Dennis Komm,et al. The online knapsack problem: Advice and randomization , 2014, Theor. Comput. Sci..
[10] Michal Forisek,et al. On the Power of Advice and Randomization for the Disjoint Path Allocation Problem , 2014, SOFSEM.
[11] Michal Forisek,et al. Advice Complexity of Online Coloring for Paths , 2012, LATA.
[12] Dennis Komm,et al. On the Advice Complexity of the Set Cover Problem , 2012, CSR.
[13] Dennis Komm,et al. The string guessing problem as a method to prove lower bounds on the advice complexity , 2013, Theor. Comput. Sci..
[14] Euripides Markou,et al. Online Graph Exploration with Advice , 2012, SIROCCO.