On the advantage of overlapping clusters for minimizing conductance (Q472486): Difference between revisions

@@ Property / author @@
-Vahab S. Mirrokni
@@ Property / author: Vahab S. Mirrokni / rank @@
-Normal rank
@@ Property / author @@
+Vahab S. Mirrokni
@@ Property / author: Vahab S. Mirrokni / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+D30
@@ Property / Mathematics Subject Classification ID: 91D30 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6371107
@@ Property / zbMATH DE Number: 6371107 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+conductance
@@ Property / zbMATH Keywords: conductance / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation
@@ Property / zbMATH Keywords: approximation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+social networks
@@ Property / zbMATH Keywords: social networks / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+clustering
@@ Property / zbMATH Keywords: clustering / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-013-9761-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2026511931
@@ Property / OpenAlex ID: W2026511931 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation for directed cut problems
@@ Property / cites work: Improved approximation for directed cut problems / rank @@
+Normal rank
@@ Property / cites work @@
+$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
+Normal rank
@@ Property / cites work @@
+Euclidean distortion and the sparsest cut
@@ Property / cites work: Euclidean distortion and the sparsest cut / rank @@
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+Clustering Social Networks
@@ Property / cites work: Clustering Social Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Min-max Graph Partitioning and Small Set Expansion
+Normal rank
@@ Property / cites work @@
+Q3507780
@@ Property / cites work: Q3507780 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm of MULTIWAY CUT.
+Normal rank
@@ Property / cites work @@
+Q2921658
@@ Property / cites work: Q2921658 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating directed multicuts
@@ Property / cites work: Approximating directed multicuts / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of cut problems in directed graphs
@@ Property / cites work: Hardness of cut problems in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial flow-cut gaps and hardness of directed cut problems
+Normal rank
@@ Property / cites work @@
+The importance of being biased
@@ Property / cites work: The importance of being biased / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximate Graph Partitioning Algorithms
@@ Property / cites work: Fast Approximate Graph Partitioning Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Q4471328
@@ Property / cites work: Q4471328 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph partitioning using single commodity flows
@@ Property / cites work: Graph partitioning using single commodity flows / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy approximation algorithms for directed multicuts
+Normal rank
@@ Property / cites work @@
+Q2921657
@@ Property / cites work: Q2921657 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4736836
@@ Property / cites work: Q4736836 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549709
@@ Property / cites work: Q3549709 / rank @@
+Normal rank
@@ Property / cites work @@
+Hearing the clusters of a graph: A distributed algorithm
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Cuts within Twice the Optimal
@@ Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank @@
+Normal rank
@@ Property / cites work @@
+Q5405126
@@ Property / cites work: Q5405126 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:472486