Approximating activation edge-cover and facility location problems (Q2166781): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2905594734
@@ Property / OpenAlex ID: W2905594734 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
+Normal rank
@@ Property / cites work @@
+One for the price of two: a unified approach for approximating covering problems
+Normal rank
@@ Property / cites work @@
+Steiner Tree Approximation via Iterative Randomized Rounding
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for minimum power covering problems
+Normal rank
@@ Property / cites work @@
+Q5365067
@@ Property / cites work: Q5365067 / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Lambert \(w\) function
@@ Property / cites work: On the Lambert \(w\) function / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Packing-Based Approximation Algorithm for the k-Set Cover Problem
+Normal rank
@@ Property / cites work @@
+Matroids and integrality gaps for hypergraphic steiner tree relaxations
+Normal rank
@@ Property / cites work @@
+Power optimization for connectivity problems
@@ Property / cites work: Power optimization for connectivity problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3622892
@@ Property / cites work: Q3622892 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+Normal rank
@@ Property / cites work @@
+Approximating minimum-power edge-covers and 2,3-connectivity
+Normal rank
@@ Property / cites work @@
+Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
+Normal rank
@@ Property / cites work @@
+Q5365097
@@ Property / cites work: Q5365097 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter Bounds for Graph Steiner Tree Approximation
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
+Normal rank
@@ Property / cites work @@
+Q4526991
@@ Property / cites work: Q4526991 / rank @@
+Normal rank
@@ Property / cites work @@
+A Tight Analysis of the Greedy Algorithm for Set Cover
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank