578 search results - page 17 / 116 » The Minimum-Entropy Set Cover Problem |
100
click to vote
COR
2007
15 years 2 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
116
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
138
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
114
click to vote
DATE
2000
IEEE
15 years 6 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
120
click to vote
DAM
2010
15 years 2 months ago
2010
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...