Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach

Article Details
Title:	Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach
Article URLs:	https://doi.org/10.1137/1.9781611974331.ch51 http://dl.acm.org/citation.cfm?id=2884486
Alternative Article URLs:
Authors:	David Peleg	The Weizmann Institute of Science, Rehovot, Israel
Authors:	Shay Solomon	Tel Aviv University, Tel Aviv 69978, Israel, School of Computer Science
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/soda/PelegS16
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2016