Online Bipartite Matching with Amortized O(log 2 n) Replacements

@article{Bernstein2019OnlineBM,
  title={Online Bipartite Matching with Amortized O(log 2 n) Replacements},
  author={Aaron Bernstein and Jacob Holm and Eva Rotenberg},
  journal={Journal of the ACM (JACM)},
  year={2019},
  volume={66},
  pages={1 - 23}
}
In the online bipartite matching problem with replacements, all the vertices on one side of the bipartition are given, and the vertices on the other side arrive one-by-one with all their incident edges. The goal is to maintain a maximum matching while minimizing the number of changes (replacements) to the matching. We show that the greedy algorithm that always takes the shortest augmenting path from the newly inserted vertex (denoted the SAP protocol) uses at most amortized O(log 2 n… 

Figures from this paper

Online Graph Matching Problems with a Worst-Case Reassignment Budget
TLDR
This paper proposes to consider the general question of how requiring a non-amortized hard budget $k$ on the number of reassignments affects the algorithms' performances, under various models from the literature.
A Tight Bound for Shortest Augmenting Paths on Trees
TLDR
A tight \(O(n \log n)\) upper bound is proved for the total length of shortest augmenting paths for trees improving over \(O(\log ^2 n) bound" in this paper.
Online Minimum Cost Matching with Recourse on the Line
TLDR
This work shows an O(1)competitive algorithm for online matching on the line with amortized recourse of O(log n), the first non-trivial result for min-cost bipartite matching with recourse, and gives a (1+ε)-competitive algorithm that reassigns any request at most O(ε−1) times.
Online Minimum Cost Matching on the Line with Recourse
TLDR
This work gives a $(1+\varepsilon)-competitive algorithm that reassigns any request at most $O(n\log n)$ times, the first non-trivial result for min-cost bipartite matching with recourse and obtains a near-optimal result.
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier
Given a directed, weighted graph G = (V,E) undergoing edge insertions, the incremental single-source shortest paths (SSSP) problem asks for the maintenance of approximate distances from a dedicated
Maintaining Perfect Matchings at Low Cost
TLDR
A two-stage model where the trade-off between quality and robustness of solutions is studied, and there exists an algorithm that is $(3,1)$-robust for any metric if one knows the number of arriving nodes in advance.
Theory of Computation Laboratory 4 Coresets for Graph Matching
TLDR
This master thesis focuses on randomized composable coresets as building blocks for memoryefficient algorithms in the context of massive graphs, and proposes a new coreset for bipartite graphs with size O(n) which is based on the notion of server flows of [21].
Online Maximum Matching with Recourse
TLDR
It is shown that no deterministic algorithm better than $1+1/(k-1)$ exists, and an improvement of the greedy algorithm is presented, which for small values of $k$ outperforms the algorithm of [AMP, 2013].
Recoloring Unit Interval Graphs with Logarithmic Recourse Budget
In this paper we study the problem of coloring a unit interval graph which changes dynamically. In our model the unit intervals are added or removed one at the time, and have to be colored
Online Matching with Recourse: Random Edge Arrivals
TLDR
This paper considers the more general model where all the vertices are known in advance, but the edges of the graph are revealed one at a time, and shows a family of graphs for which the expected recourse is Ω ( n2 log n ) .
...
1
2
3
...

References

SHOWING 1-10 OF 42 REFERENCES
Shortest Augmenting Paths for Online Matchings on Trees
TLDR
An O(nlog2n) $\mathcal {O}(n \log ^{2}n)$ upper bound for the total length of augmenting paths for trees is proved.
Better bounds for matchings in the streaming model
TLDR
Improved bounds for approximating maximum matchings in bipartite graphs in the streaming model are presented and it is shown that a simple fractional load balancing approach achieves approximation ratio.
Online Steiner Tree with Deletions
TLDR
An online algorithm is given that maintains a Steiner tree under only deletions, and an algorithm that changes only a constant number of edges upon each request, and maintains a constant-competitive tree at all times is given.
Online Bipartite Perfect Matching With Augmentations
TLDR
This paper derives the first result known to match the existing lower bound for forests, which shows that any online algorithm must have switching cost Omega(n log n), even when G is restricted to be a forest.
Online Bipartite Matching in Offline Time
TLDR
By introducing proper amortization the authors can obtain an incremental algorithm that maintains the maximum size matching in total O(√nm) time, which matches the running time of one of the fastest static maximum matching algorithms that was given by Hopcroft and Karp.
The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
TLDR
A primal-dual algorithm is given that makes only a single swap per step (in addition to adding the edge connecting the new point to the previous ones), and such that the tree's cost is only a constant times the optimal cost.
The power of deferral: maintaining a constant-competitive steiner tree online
TLDR
Showing that these dual radii cannot change too rapidly is the technical heart of the paper, and allows us to give a hard bound on the number of swaps per arrival, while maintaining a constant-competitive tree at all times.
Shortest Augmenting Paths for Online Matchings on Trees
TLDR
An \(O(n \log ^2n)\) upper bound for the total length of augmenting paths for trees is proved.
Deterministic decremental single source shortest paths: beyond the o(mn) bound
TLDR
This paper presents the first deterministic decremental SSSP algorithm that breaks the Even-Shiloach bound of O(mn) total update time, for unweighted and undirected graphs, and is faster than all existing randomized algorithms.
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree
TLDR
This paper shows a polylogarithmic time (4+ε)-approximate algorithm for planar graphs, one of the main building blocks of the algorithms are dynamic distance oracles for vertex-labeled graphs, which are of independent interest.
...
1
2
3
4
5
...