An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2008.10.033
+Normal rank
@@ Property / OpenAlex ID @@
+W2176356921
@@ Property / OpenAlex ID: W2176356921 / rank @@
+Normal rank
@@ Property / cites work @@
+When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
+Normal rank
@@ Property / cites work @@
+Master-slave strategy and polynomial approximation
+Normal rank
@@ Property / cites work @@
+Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Saving an epsilon
@@ Property / cites work: Saving an epsilon / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
+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 @@
+The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing
+Normal rank
@@ Property / cites work @@
+Improved performance of the greedy algorithm for partial cover
+Normal rank
@@ Property / cites work @@
+Q4258215
@@ Property / cites work: Q4258215 / rank @@
+Normal rank