English

Understanding Zadimoghaddam's Edge-weighted Online Matching Algorithm: Unweighted Case

Data Structures and Algorithms 2019-10-08 v1 Computer Science and Game Theory

Abstract

This article identifies a key algorithmic ingredient in the edge-weighted online matching algorithm by Zadimoghaddam (2017) and presents a simplified algorithm and its analysis to demonstrate how it works in the unweighted case.

Keywords

Cite

@article{arxiv.1910.02569,
  title  = {Understanding Zadimoghaddam's Edge-weighted Online Matching Algorithm: Unweighted Case},
  author = {Zhiyi Huang and Runzhou Tao},
  journal= {arXiv preprint arXiv:1910.02569},
  year   = {2019}
}
R2 v1 2026-06-23T11:35:52.705Z