On the advantage of overlapping clusters for minimizing conductance
type: Item
instance of: scholarly article
title: On the advantage of overlapping clusters for minimizing conductance
zbMATH Open document ID: 1303.05196
author: Rohit Khandekar
author: Guy Kortsarz
author: Vahab S. Mirrokni
published in: Algorithmica
publication date: 2014-11-19T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 91D30
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6371107
zbMATH Keywords: conductance
zbMATH Keywords: approximation
zbMATH Keywords: social networks
zbMATH Keywords: clustering
MaRDI profile type: Publication
full work available at URL: s00453-013-9761-8
OpenAlex ID: W2026511931
cites work: Improved approximation for directed cut problems
cites work: $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
cites work: Euclidean distortion and the sparsest cut
cites work: Expander flows, geometric embeddings and graph partitioning
cites work: Clustering Social Networks
cites work: Min-max Graph Partitioning and Small Set Expansion
cites work: Q3507780
cites work: An improved approximation algorithm of MULTIWAY CUT.
cites work: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
cites work: Approximating directed multicuts
cites work: Hardness of cut problems in directed graphs
cites work: Polynomial flow-cut gaps and hardness of directed cut problems
cites work: The importance of being biased
cites work: Fast Approximate Graph Partitioning Algorithms
cites work: The dense \(k\)-subgraph problem
cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
cites work: Primal-dual approximation algorithms for integral flow and multicut in trees
cites work: Q4471328
cites work: Graph partitioning using single commodity flows
cites work: Greedy approximation algorithms for directed multicuts
cites work: On distance scales, embeddings, and efficient relaxations of the cut cone
cites work: Q4736836
cites work: Q3549709
cites work: Hearing the clusters of a graph: A distributed algorithm
cites work: Finding k Cuts within Twice the Optimal
cites work: Q5405126
DOI: 10.1007/S00453-013-9761-8
description: scientific article; zbMATH DE number 6371107