On nonlinear multi-covering problems
type: Item
instance of: scholarly article
title: On nonlinear multi-covering problems
zbMATH Open document ID: 1388.90101
author: Reuven Cohen
author: Mira Gonen
author: Asaf Levin
author: Shmuel Onn
published in: Journal of Combinatorial Optimization
publication date: 2017-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6687855
zbMATH Keywords: covering problems
zbMATH Keywords: circular-arcs
zbMATH Keywords: intervals
zbMATH Keywords: nonlinear integer programming
MaRDI profile type: Publication
full work available at URL: s10878-015-9985-4
OpenAlex ID: W2275744826
cites work: Q4263699
cites work: On interval and circular-arc covering problems
cites work: Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
cites work: Combination Can Be Hard: Approximability of the Unique Coverage Problem
cites work: Q3579437
cites work: A threshold of ln n for approximating set cover
cites work: Q4198056
cites work: Optimizing over Consecutive 1's and Circular 1's Constraints
cites work: A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
cites work: A 4.31-approximation for the geometric unique coverage problem on unit disks
cites work: Q4821529
cites work: Q3992465
cites work: The parameterized complexity of unique coverage and its variants
cites work: The Budgeted Unique Coverage Problem and Color-Coding
cites work: The Parameterized Complexity of the Unique Coverage Problem
cites work: Nonlinear discrete optimization. An algorithmic theory
cites work: Convex combinatorial optimization
cites work: Q4298260
DOI: 10.1007/S10878-015-9985-4
description: scientific article; zbMATH DE number 6687855