(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time

Fabrizio Grandoni; Stefano Leonardi; Piotr Sankowski; Chris Schwiegelshohn; Shay Solomon

(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time

Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon

School of Electrical Engineering

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study the matching problem in the incremental setting, where we are given a sequence of edge insertions and aim at maintaining a near-maximum cardinality matching of the graph with small update time. We present a deterministic algorithm that, for any constant ε > 0, maintains a (1 + ε)-approximate matching with constant amortized update time per insertion.

Original language	English
Title of host publication	SODA 2019
Pages	1886-1898
Number of pages	13
State	Published - 2019
Event	30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 - San Diego, United States Duration: 6 Jan 2019 → 9 Jan 2019

Conference

Conference	30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019
Country/Territory	United States
City	San Diego
Period	6/01/19 → 9/01/19

All Science Journal Classification (ASJC) codes

Software
General Mathematics

Cite this

@inproceedings{89083ab4c5d344228f6dcbcc8e21a3bd,

title = "(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time",

abstract = "We study the matching problem in the incremental setting, where we are given a sequence of edge insertions and aim at maintaining a near-maximum cardinality matching of the graph with small update time. We present a deterministic algorithm that, for any constant ε > 0, maintains a (1 + ε)-approximate matching with constant amortized update time per insertion.",

author = "Fabrizio Grandoni and Stefano Leonardi and Piotr Sankowski and Chris Schwiegelshohn and Shay Solomon",

year = "2019",

language = "الإنجليزيّة",

pages = "1886--1898",

booktitle = "SODA 2019",

note = "30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 ; Conference date: 06-01-2019 Through 09-01-2019",

}

TY - GEN

T1 - (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time

AU - Grandoni, Fabrizio

AU - Leonardi, Stefano

AU - Sankowski, Piotr

AU - Schwiegelshohn, Chris

AU - Solomon, Shay

PY - 2019

Y1 - 2019

N2 - We study the matching problem in the incremental setting, where we are given a sequence of edge insertions and aim at maintaining a near-maximum cardinality matching of the graph with small update time. We present a deterministic algorithm that, for any constant ε > 0, maintains a (1 + ε)-approximate matching with constant amortized update time per insertion.

AB - We study the matching problem in the incremental setting, where we are given a sequence of edge insertions and aim at maintaining a near-maximum cardinality matching of the graph with small update time. We present a deterministic algorithm that, for any constant ε > 0, maintains a (1 + ε)-approximate matching with constant amortized update time per insertion.

UR - http://www.scopus.com/inward/record.url?scp=85066928476&partnerID=8YFLogxK

M3 - منشور من مؤتمر

SP - 1886

EP - 1898

BT - SODA 2019

T2 - 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019

Y2 - 6 January 2019 through 9 January 2019

ER -

(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time

Abstract

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this