Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities

Susanne Albers, Sebastian Schubert. Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. In Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, editors, 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany. Volume 244 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

@inproceedings{AlbersS22,
  title = {Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities},
  author = {Susanne Albers and Sebastian Schubert},
  year = {2022},
  doi = {10.4230/LIPIcs.ESA.2022.4},
  url = {https://doi.org/10.4230/LIPIcs.ESA.2022.4},
  researchr = {https://researchr.org/publication/AlbersS22},
  cites = {0},
  citedby = {0},
  booktitle = {30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany},
  editor = {Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman},
  volume = {244},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-247-1},
}