An improved approximation algorithm for requirement cut (Q991474): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2010.02.009
@@ Property / DOI: 10.1016/j.orl.2010.02.009 / 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.1016/j.orl.2010.02.009
+Normal rank
@@ Property / OpenAlex ID @@
+W1992849490
@@ Property / OpenAlex ID: W1992849490 / rank @@
+Normal rank
@@ Property / cites work @@
+The multi-multiway cut problem
@@ Property / cites work: The multi-multiway cut problem / rank @@
+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 @@
+Approximation Algorithms for Steiner and Directed Multicuts
+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 Multicommodity-Type Problems with Guarantees Independent of the Graph Size
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for requirement cut on graphs
+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 @@
+.1016/J.ORL.2010.02.009
@@ Property / DOI: 10.1016/J.ORL.2010.02.009 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:991474