Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460): Difference between revisions

@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Set Partitioning: A survey
@@ Property / cites work: Set Partitioning: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768359
@@ Property / cites work: Q2768359 / rank @@
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for the facility location problem with submodular penalties
+Normal rank
@@ Property / cites work @@
+Q4228484
@@ Property / cites work: Q4228484 / rank @@
+Normal rank
@@ Property / cites work @@
+A push-relabel framework for submodular function minimization and applications to parametric optimization
+Normal rank
@@ Property / cites work @@
+Submodular functions and optimization.
@@ Property / cites work: Submodular functions and optimization. / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for partial covering problems
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Set Covering and Vertex Cover Problems
+Normal rank
@@ Property / cites work @@
+A Faster Scaling Algorithm for Minimizing Submodular Functions
+Normal rank
@@ Property / cites work @@
+A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
+Normal rank
@@ Property / cites work @@
+Submodular Function Minimization under Covering Constraints
+Normal rank
@@ Property / cites work @@
+Q4633938
@@ Property / cites work: Q4633938 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to approximating partial covering problems
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty
+Normal rank
@@ Property / cites work @@
+Q3682236
@@ Property / cites work: Q3682236 / rank @@
+Normal rank
@@ Property / cites work @@
+A faster strongly polynomial time algorithm for submodular function minimization
+Normal rank
@@ Property / cites work @@
+Covering, Packing and Knapsack Problems
@@ Property / cites work: Covering, Packing and Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties
+Normal rank