On the advice complexity of the online dominating set problem

[1]  Lucia Keller,et al.  Online Coloring of Bipartite Graphs with and without Advice , 2012, Algorithmica.

[2]  Alejandro López-Ortiz,et al.  On the Advice Complexity of the k-server Problem Under Sparse Metrics , 2013, Theory of Computing Systems.

[3]  Patric R. J. Östergård,et al.  Computing the Domination Number of Grid Graphs , 2011, Electron. J. Comb..

[4]  Jesper W. Mikkelsen.  Randomization can be as helpful as a glimpse of the future in online computation , 2015, ICALP.

[5]  Pierre Fraigniaud,et al.  Online computation with advice , 2011, Theor. Comput. Sci..

[6]  Stephan Eidenbenz,et al.  Online Dominating Set , 2018, Algorithmica.

[7]  Sebastian Seibert,et al.  Advice Complexity of the Online Coloring Problem , 2013, CIAC.

[8]  Adi Rosén,et al.  On Online Algorithms with Advice for the k-Server Problem , 2011, Theory of Computing Systems.

[9]  Dennis Komm,et al.  Call Admission Problems on Grids with Advice (Extended Abstract) , 2018, WAOA.

[10]  Dennis Komm,et al.  The string guessing problem as a method to prove lower bounds on the advice complexity , 2013, Theor. Comput. Sci..

[11]  Dennis Komm,et al.  On the Advice Complexity of the k-Server Problem , 2011, ICALP.

[12]  Dennis Komm,et al.  On the Advice Complexity of Online Problems , 2009, ISAAC.

[13]  Joan Boyar,et al.  The Advice Complexity of a Class of Hard Online Problems , 2016, Theory of Computing Systems.

[14]  Juraj Hromkovic,et al.  Information Complexity of Online Problems , 2010, MFCS.

[15]  Dennis Komm,et al.  The online knapsack problem: Advice and randomization , 2014, Theor. Comput. Sci..

[16]  Stefan Dobrev,et al.  How Much Information about the Future Is Needed? , 2008, SOFSEM.

[17]  Dennis Komm,et al.  Online algorithms with advice: The tape model , 2017, Inf. Comput..

[18]  Joan Boyar,et al.  Weighted Online Problems with Advice , 2017, Theory of Computing Systems.

[19]  Wen-Guey Tzeng,et al.  On-Line Algorithms for the Dominating Set Problem , 1997, Inf. Process. Lett..

[20]  Michal Forisek,et al.  On the Power of Advice and Randomization for the Disjoint Path Allocation Problem , 2014, SOFSEM.

[21]  Dennis Komm,et al.  Call Admission Problems on Trees with Advice - (Extended Abstract) , 2019, IWOCA.

[22]  Jeanette P. Schmidt,et al.  All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings , 1998, SIAM J. Comput..

[23]  Peter Elias,et al.  Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[24]  Alejandro López-Ortiz,et al.  Online Bin Packing with Advice , 2012, Algorithmica.

[25]  Online Algorithms with Advice , 2017 .

[26]  Reza Dorrigiv,et al.  On the Advice Complexity of Buffer Management , 2012, ISAAC.