English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

New Deterministic Approximation Algorithms for Fully Dynamic Matching

MPS-Authors
There are no MPG-Authors in the publication available
External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bhattacharya, S., Henzinger, M., & Nanongkai, D. (2016). New Deterministic Approximation Algorithms for Fully Dynamic Matching. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (pp. 398-411). New York, NY: ACM. doi:10.1145/2897518.2897568.


Cite as: https://hdl.handle.net/21.11116/0000-000E-5F4B-5
Abstract
There is no abstract available