English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time

Bhattacharya, S., Henzinger, M., & Nanongkai, D. (2017). Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 470-489). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.

Item is

Basic

show hide
Genre: Conference Paper
Latex : Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in $O(\log^3 n)$ Worst Case Update Time

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bhattacharya, Sayan1, Author           
Henzinger, Monika1, Author
Nanongkai, Danupon1, Author                 
Affiliations:
1External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2017-04-1020172017
 Publication Status: Issued
 Pages: An extended abstract of this paper appeared in SODA 2017
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1137/1.9781611974782
BibTex Citekey: BhattacharyaSODA17
 Degree: -

Event

show
hide
Title: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Barcelona, Spain
Start-/End Date: 2017-01-16 - 2017-01-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2017
  Subtitle : SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19
Source Genre: Proceedings
 Creator(s):
Klein, Phlip N.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 470 - 489 Identifier: ISBN: 978-1-61197-478-2