Covering problems

Known as: Covering problem 
In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2018
05019662018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We study a generalization of covering problems called partial covering. Here we wish to cover only a desired number of elements… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A capacitated covering IP is an integer program of the form minf xjUx d; 0 x b; x 2 Z+g, where all entries of , U , and d are… (More)
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm was initially designed for… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
LetC be a binary code of lengthn (i.e., a subset of {0, 1} n ). TheCovering Radius of C is the smallest integerr such that each… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The set covering problem and the minimum cost assignment problem (respectively known as unate and binate covering problem) arise… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
  • Serge A. Plotkiny, David B. Shmoysz, Eva Tardosx
  • 1995
This paper presents fast algorithms that nd approximate solutions for a general class of problems, which we call fractional… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Covering problems occur at several steps during logic synthesis including two-level minimization and DAG covering. This paper… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Improvecl Approximations of ~a&in~ and Covering Pro~lems* 
Is this relevant?
Highly Cited
1981
Highly Cited
1981
This paper was motivated by a practical problem related to databases for image processing: given a set of points in the plane… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 6
Is this relevant?