Online Matching in Regular Bipartite Graphs with Randomized Adversary

DOI10.1007/978-3-319-98355-4_17zbMath1514.68212OpenAlexW2885322233MaRDI QIDQ6163632

J. Fàbrega, Xavier Muñoz

Publication date: 30 June 2023

Published in: Adventures Between Lower Bounds and Higher Altitudes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-98355-4_17

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• Online Graph Coloring with Advice and Randomized Adversary
• The Complexity of Paging Against a Probabilistic Adversary
• AdWords and generalized online matching
• Randomized online algorithms for minimum metric bipartite matching
• Online Weighted Matching
• Online Matching in Regular Bipartite Graphs

This page was built for publication: Online Matching in Regular Bipartite Graphs with Randomized Adversary