AI Chat AI Image Generator AI Video Text to Speech

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

10/07/2019

∙

by Zhiyi Huang, et al.

∙

∙

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.

Zhiyi Huang
42 publications
Runzhou Tao
14 publications

page 1

page 2

page 3

page 4

research

∙ 10/08/2019

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

This article presents a simplification of Zadimoghaddam's algorithm for ...

0 Zhiyi Huang, et al. ∙

research

∙ 08/26/2021

Commutative Monoid Formalism for Weighted Coupled Cell Networks and Invariant Synchrony Patterns

This paper presents a framework based on matrices of monoids for the stu...

0 Pedro M. Sequeira, et al. ∙

research

∙ 10/22/2022

Edge-weighted Online Stochastic Matching: Beating 1-1/e

We study the edge-weighted online stochastic matching problem. Since Fel...

0 Shuyi Yan, et al. ∙

research

∙ 12/01/2008

A Matlab Implementation of a Flat Norm Motivated Polygonal Edge Matching Method using a Decomposition of Boundary into Four 1-Dimensional Currents

We describe and provide code and examples for a polygonal edge matching ...

0 Simon P. Morgan, et al. ∙

research

∙ 03/06/2022

The Power of Multiple Choices in Online Stochastic Matching

We study the power of multiple choices in online stochastic matching. De...

0 Zhiyi Huang, et al. ∙

research

∙ 07/06/2021

Making Three Out of Two: Three-Way Online Correlated Selection

Two-way online correlated selection (two-way OCS) is an online algorithm...

0 Yongho Shin, et al. ∙

research

∙ 11/02/2018

Nonparametric identification in the dynamic stochastic block model

We show nonparametric identification of the parameters in the dynamic st...

0 Ann-Kristin Becker, et al. ∙