Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems
We study the Weighted t-Uniform Sparsest Cut (Weighted t-USC) and other related problems. In an instance of the Weighted t-USC problem, a parameter t and an undirected graph G = ( V , E ) with edge-weights w : E → R ≥ 0 and vertex-weights η : V → R + are given. The goal is to find a vertex set S ⊆ V...
|Published in:||Journal of computer and system sciences : JCSS, Vol. 82, No. 6 (2016), p. 1044-1063|
|Other Involved Persons:|
|QR Code:||Show QR Code|