Fully Online Matching with Advice on General Bipartite Graphs and Paths

We consider the problem of finding a maximum-size matching in a fully online setting, where the vertices of a bipartite graph are given one after the other in discrete time steps, together with all edges to previously revealed vertices. In each time step, an online algorithm has to irrevocably decide which of the newly presented edges is going to be part of the matching.

[1]  Dennis Komm,et al.  Disjoint Path Allocation with Sublinear Advice , 2015, COCOON.

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

[3]  Elisabet Burjons,et al.  The k-Server Problem with Advice in d Dimensions and on the Sphere , 2018, SOFSEM.

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

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

[6]  Juraj Hromkovic,et al.  On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles , 2013, COCOON.

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

[8]  Elisabet Burjons,et al.  Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract) , 2016, SOFSEM.

[9]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Dennis Komm.  An Introduction to Online Computation: Determinism, Randomization, Advice , 2016 .

[11]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

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

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

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

[15]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

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

[17]  Dennis Komm,et al.  On the Advice Complexity of the Set Cover Problem , 2012, CSR.

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

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

[20]  Dennis Komm,et al.  Improved analysis of the online set cover problem with advice , 2017, Theor. Comput. Sci..

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

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

[23]  Dennis Komm,et al.  On the Advice Complexity of the Knapsack Problem , 2012, LATIN.

[24]  Pierre Fraigniaud,et al.  Online computation with advice , 2009, Theor. Comput. Sci..

[25]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[26]  Michal Forisek,et al.  Advice Complexity of Online Coloring for Paths , 2012, LATA.

[27]  Yishay Mansour,et al.  A Local Computation Approximation Scheme to Maximum Matching , 2013, APPROX-RANDOM.

[28]  L. Lovász.  Matching Theory (North-Holland mathematics studies) , 1986 .

[29]  Joan Boyar,et al.  Online Algorithms with Advice: A Survey , 2016, SIGA.

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