On the Advantage of Overlapping Clusters for Minimizing Conductance
- 6 March 2013
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 69 (4) , 844-863
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Hearing the clusters of a graph: A distributed algorithmAutomatica, 2012
- $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ TimeSIAM Journal on Computing, 2010
- Polynomial flow-cut gaps and hardness of directed cut problemsJournal of the ACM, 2009
- Engineering graph clusteringACM Journal of Experimental Algorithmics, 2008
- Embeddings of negative-type metrics and an improved approximation to generalized sparsest cutACM Transactions on Algorithms, 2008
- Greedy approximation algorithms for directed multicutsNetworks, 2005
- The Dense k -Subgraph ProblemAlgorithmica, 2001
- An Improved Approximation Algorithm for MULTIWAY CUTJournal of Computer and System Sciences, 2000
- Fast Approximate Graph Partitioning AlgorithmsSIAM Journal on Computing, 1999
- Finding k Cuts within Twice the OptimalSIAM Journal on Computing, 1995