An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (Q2205937): 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.tcs.2020.07.014
+Normal rank
@@ Property / OpenAlex ID @@
+W3042489864
@@ Property / OpenAlex ID: W3042489864 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4537735
@@ Property / cites work: Q4537735 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+A unified approach to approximating partial covering problems
+Normal rank
@@ Property / cites work @@
+Partial multicuts in trees
@@ Property / cites work: Partial multicuts in trees / rank @@
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank