Approximation algorithms for requirement cut on graphs (Q848961): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-008-9171-5
@@ Property / DOI: 10.1007/s00453-008-9171-5 / 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-008-9171-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2138522610
@@ Property / OpenAlex ID: W2138522610 / rank @@
+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 @@
+An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
+Normal rank
@@ Property / cites work @@
+The multi-multiway cut problem
@@ Property / cites work: The multi-multiway cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm of MULTIWAY CUT.
+Normal rank
@@ Property / cites work @@
+The Steiner k-Cut Problem
@@ Property / cites work: The Steiner k-Cut Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
+Normal rank
@@ Property / cites work @@
+Rounding algorithms for a geometric embedding of minimum multiway cut
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Steiner and Directed Multicuts
+Normal rank
@@ Property / cites work @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+Normal rank
@@ Property / cites work @@
+An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the covering Steiner problem
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+The geometry of graphs and some of its algorithmic applications
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q2768268
@@ Property / cites work: Q2768268 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828991
@@ Property / cites work: Q4828991 / rank @@
+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 / DOI @@
+.1007/S00453-008-9171-5
@@ Property / DOI: 10.1007/S00453-008-9171-5 / rank @@
+Normal rank