Approximating activation edge-cover and facility location problems
From MaRDI portal
Recommendations
- Approximating activation edge-cover and facility location problems
- The multi‐integer set cover and the facility terminal cover problem
- Approximation algorithms for connected facility location problems
- Improved Approximation Algorithm for Connected Facility Location Problems
- Linear time algorithms for approximating the facility terminal cover problem
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- A threshold of ln n for approximating set cover
- A Tight Analysis of the Greedy Algorithm for Set Cover
- Algorithms for implicit hitting set problems
- An analysis of the greedy algorithm for the submodular set covering problem
- Analysis of approximation algorithms for k-set cover using factor-revealing linear programs
- Approximating minimum-power edge-covers and 2,3-connectivity
- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
- Approximation algorithms for combinatorial problems
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- scientific article; zbMATH DE number 1559541 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- Improved approximation algorithms for minimum power covering problems
- Inequalities on the Lambert W function and hyperpower function
- Matroids and integrality gaps for hypergraphic Steiner tree relaxations
- On the Lambert \(w\) function
- One for the price of two: a unified approach for approximating covering problems
- Packing-based approximation algorithm for the k-set cover problem
- Paths, Trees, and Flowers
- Power optimization for connectivity problems
- Steiner tree approximation via iterative randomized rounding
- Survivable network design problems in wireless networks
- Tighter Bounds for Graph Steiner Tree Approximation
Cited in
(6)- Approximation algorithms for connectivity augmentation problems
- Approximating activation edge-cover and facility location problems
- The capacity formulation of the capacitated edge activation problem
- A polyhedral analysis of the capacitated edge activation problem with uncertain demands
- Mind the gap: edge facility location problems in theory and practice
- Better-than-2 approximations for weighted tree augmentation and applications to Steiner tree
This page was built for publication: Approximating activation edge-cover and facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092379)
