We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Online Matching in Regular Bipartite Graphs.
- Authors
Barrière, Lali; Muñoz, Xavier; Fuchs, Janosch; Unger, Walter
- Abstract
In an online problem, the input is revealed one piece at a time. In every time step, the online algorithm has to produce a part of the output, based on the partial knowledge of the input. Such decisions are irrevocable, and thus online algorithms usually lead to nonoptimal solutions. The impact of the partial knowledge depends strongly on the problem. If the algorithm is allowed to read binary information about the future, the amount of bits read that allow the algorithm to solve the problem optimally is the so-called advice complexity. The quality of an online algorithm is measured by its competitive ratio, which compares its performance to that of an optimal offline algorithm. In this paper we study online bipartite matchings focusing on the particular case of bipartite matchings in regular graphs. We give tight upper and lower bounds on the competitive ratio of the online deterministic bipartite matching problem. The competitive ratio turns out to be asymptotically equal to the known randomized competitive ratio. Afterwards, we present an upper and lower bound for the advice complexity of the online deterministic bipartite matching problem.
- Subjects
ALGORITHMS; GRAPH theory; BIPARTITE graphs; TANNER graphs; REGULAR graphs
- Publication
Parallel Processing Letters, 2018, Vol 28, Issue 2, pN.PAG
- ISSN
0129-6264
- Publication type
Article
- DOI
10.1142/S0129626418500081