16404 search results - page 79 / 3281 » A set coverage problem |
100
Voted
DCG
2010
15 years 21 days ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
PRDC
2005
IEEE
15 years 6 months ago
2005
IEEE
TING SETS: A BASIC ABSTRACTION FOR ASYNCHRONOUS AGREEMENT PROBLEMS ROY FRIEDMAN , ACHOUR MOSTEFAOUI , MICHEL RAYNAL
128
Voted
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
94
Voted
SWAT
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
121
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...