An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518): 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.1007/s40305-021-00355-8
+Normal rank
@@ Property / OpenAlex ID @@
+W3188073793
@@ Property / OpenAlex ID: W3188073793 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A primal-dual algorithm for the generalized prize-collecting Steiner forest problem
+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 @@
+Q2934723
@@ Property / cites work: Q2934723 / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Steiner Tree Approximation via Iterative Randomized Rounding
+Normal rank
@@ Property / cites work @@
+A push-relabel framework for submodular function minimization and applications to parametric optimization
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2136518