Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  On Fully Dynamic Graph Sparsifiers

Abraham, I., Durfee, D., Koutis, I., Krinninger, S., & Peng, R. (2016). On Fully Dynamic Graph Sparsifiers. In FOCS 2016 (pp. 396-405). Piscataway, NJ: IEEE. doi:10.1109/FOCS.2016.44.

Item is

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Abraham, Ittai1, Autor
Durfee, David1, Autor
Koutis, Ioannis1, Autor
Krinninger, Sebastian2, Autor           
Peng, Richard1, Autor
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: Computer Science, Data Structures and Algorithms, cs.DS
 Zusammenfassung: We initiate the study of dynamic algorithms for graph sparsification problems and obtain fully dynamic algorithms, allowing both edge insertions and edge deletions, that take polylogarithmic time after each update in the graph. Our three main results are as follows. First, we give a fully dynamic algorithm for maintaining a $ (1 \pm \epsilon) $-spectral sparsifier with amortized update time $poly(\log{n}, \epsilon^{-1})$. Second, we give a fully dynamic algorithm for maintaining a $ (1 \pm \epsilon) $-cut sparsifier with \emph{worst-case} update time $poly(\log{n}, \epsilon^{-1})$. Both sparsifiers have size $ n \cdot poly(\log{n}, \epsilon^{-1})$. Third, we apply our dynamic sparsifier algorithm to obtain a fully dynamic algorithm for maintaining a $(1 + \epsilon)$-approximation to the value of the maximum flow in an unweighted, undirected, bipartite graph with amortized update time $poly(\log{n}, \epsilon^{-1})$.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 20162016
 Publikationsstatus: Erschienen
 Seiten: 67 p.
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: DOI: 10.1109/FOCS.2016.44
BibTex Citekey: Abrahamdkkp2016
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 57th Annual IEEE Symposium on Foundations of Computer Science
Veranstaltungsort: New Brunswick, NJ, USA
Start-/Enddatum: 2016-10-09 - 2016-10-11

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: FOCS 2016
  Untertitel : 57th Annual IEEE Symposium on Foundations of Computer Science ; 9–11 October 2016 New Brunswick, New Jersey, USA
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Piscataway, NJ : IEEE
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 396 - 405 Identifikator: ISBN: 978-1-5090-3933-3