Keyword: covering problems

Found 12 papers in total
Approximability and parameterized complexity of multicover by c-intervals
Approximability and parameterized complexity of multicover by c-intervals
2015,
A c ‐interval is the disjoint union of c intervals over ‐ N . The c...
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
2013,
This paper describes a simple greedy Δ ‐approximation algorithm for any...
Backdoor Branching
Backdoor Branching
2013,
We present an exact mixed‐integer programming (MIP) solution scheme where a...
PTAS for the minimum k‐path connected vertex cover problem in unit disk graphs
PTAS for the minimum k‐path connected vertex cover problem in unit disk graphs
2013,
In the Minimum k‐Path Connected Vertex Cover Problem (M k PCVCP), we are given...
Set covering location models with stochastic critical distances
Set covering location models with stochastic critical distances
2013,
This paper formulates a new version of set covering models by introducing a...
A New Local Search Algorithm for Binary Optimization
A New Local Search Algorithm for Binary Optimization
2013,
We develop a new local search algorithm for binary optimization problems, whose...
New variations of the maximum coverage facility location problem
New variations of the maximum coverage facility location problem
2013,
Consider a competitive facility location scenario where, given a set U of n users and...
Covering problems in facility location: A review
Covering problems in facility location: A review
2012,
In this study, we review the covering problems in facility location. Here, besides a...
Partial multicovering and the d‐consecutive ones property
Partial multicovering and the d‐consecutive ones property
2011,
We design approximation algorithms for multicovering problems. We focus on...
A note on the generalized min‐sum set cover problem
A note on the generalized min‐sum set cover problem
2011,
This paper considers the generalized min-sum set cover problem. A 485-approximation...
Improved Approximation Algorithms for Label Cover Problems
Improved Approximation Algorithms for Label Cover Problems
2011,
In this paper we consider both the maximization variant Max Rep and the minimization...
Models for multi-path covering-routing problems
Models for multi-path covering-routing problems
1998,
Research on covering has concentrated on problems where the facilities are small in...
Papers per page: