Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639): Difference between revisions

@@ 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.1016/j.jcss.2016.03.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2327131051
@@ Property / OpenAlex ID: W2327131051 / rank @@
+Normal rank
@@ Property / cites work @@
+On cutting a few vertices from a graph
@@ Property / cites work: On cutting a few vertices from a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549709
@@ Property / cites work: Q3549709 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for the isoperimetric and spectral profile of graphs and related parameters
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+Min-max Graph Partitioning and Small Set Expansion
+Normal rank
@@ Property / cites work @@
+Unbalanced Graph Partitioning
@@ Property / cites work: Unbalanced Graph Partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
+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 @@
+Approximate max-flow min-(multi)cut theorems and their applications
+Normal rank
@@ Property / cites work @@
+Cut problems in graphs with a budget constraint
@@ Property / cites work: Cut problems in graphs with a budget constraint / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633907
@@ Property / cites work: Q4633907 / rank @@
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:295639