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 s...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2009-12
Hauptverfasser:	Kolla, Alexandra, Makarychev, Yury, Saberi, Amin, Teng, Shanghua
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Graph theory Linear systems Mathematical analysis Optimization Polynomials Spectra
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!