In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'coversâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

- Moshe Laifenfeld, Ari Trachtenberg
- IEEE Transactions on Information Theory
- 2008

The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap atâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
- ICALP
- 2001

We study a generalization of covering problems called partial covering. Here we wish to cover only a desired number of elementsâ€¦Â (More)

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)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Alberto Caprara, Matteo Fischetti, Paolo Toth
- Operations Research
- 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

- Moti Frances, Ami Litman
- Theory of Computing Systems
- 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

- Olivier Coudert
- DAC
- 1996

The set covering problem and the minimum cost assignment problem (respectively known as unate and binate covering problem) ariseâ€¦Â (More)

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

- Olivier Coudert, Jean Christophe Madre
- 32nd Design Automation Conference
- 1995

Covering problems occur at several steps during logic synthesis including two-level minimization and DAG covering. This paperâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Aravind Srinivasan
- STOC
- 1995

Improvecl Approximations of ~a&in~ and Covering Pro~lems*Â

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Robert J. Fowler, Mike Paterson, Steven L. Tanimoto
- Inf. Process. Lett.
- 1981

This paper was motivated by a practical problem related to databases for image processing: given a set of points in the planeâ€¦Â (More)

Is this relevant?