On nonlinear multi-covering problems
From MaRDI portal
Publication:511715
DOI10.1007/s10878-015-9985-4zbMath1388.90101OpenAlexW2275744826MaRDI QIDQ511715
Reuven Cohen, Mira Gonen, Shmuel Onn, Asaf Levin
Publication date: 22 February 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9985-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear discrete optimization. An algorithmic theory
- Convex combinatorial optimization
- A 4.31-approximation for the geometric unique coverage problem on unit disks
- On interval and circular-arc covering problems
- The parameterized complexity of unique coverage and its variants
- A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
- A threshold of ln n for approximating set cover
- The Budgeted Unique Coverage Problem and Color-Coding
- Combination Can Be Hard: Approximability of the Unique Coverage Problem
- Optimizing over Consecutive 1's and Circular 1's Constraints
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
- The Parameterized Complexity of the Unique Coverage Problem
This page was built for publication: On nonlinear multi-covering problems
