Subgraph Sparsification and Nearly Optimal Ultrasparsifiers

We consider a variation of the spectral sparsification problem where we are required to keep a subgraph of the original graph. Formally, given a union of two weighted graphs $G$ and $W$ and an integer $k$, we are asked to find a $k$-edge weighted graph $W_k$ such that $G+W_k$ is a good spectral spar...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Kolla, Alexandra, Makarychev, Yury, Saberi, Amin, Teng, Shanghua
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Discrete Mathematics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!