scientific article; zbMATH DE number 7561664
From MaRDI portal
Publication:5092379
DOI10.4230/LIPIcs.MFCS.2019.20MaRDI QIDQ5092379
Eli Shalom, Zeev Nutov, Guy Kortsarz
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmfacility locationminimum poweractivation edge-covergeneralized min-covering problem
Related Items (2)
Mind the gap: edge facility location problems in theory and practice ⋮ Approximation algorithms for connectivity augmentation problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
- Power optimization for connectivity problems
- Approximating minimum-power edge-covers and 2,3-connectivity
- Approximation algorithms for combinatorial problems
- On the Lambert \(w\) function
- An analysis of the greedy algorithm for the submodular set covering problem
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- One for the price of two: a unified approach for approximating covering problems
- Packing-Based Approximation Algorithm for the k-Set Cover Problem
- A threshold of ln n for approximating set cover
- A Greedy Heuristic for the Set-Covering Problem
- A Tight Analysis of the Greedy Algorithm for Set Cover
- Tighter Bounds for Graph Steiner Tree Approximation
- Paths, Trees, and Flowers
- Steiner Tree Approximation via Iterative Randomized Rounding
- Matroids and integrality gaps for hypergraphic steiner tree relaxations
- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
- Improved approximation algorithms for minimum power covering problems
This page was built for publication:
