2254 search results - page 15 / 451 » Computing the minimal covering set |
HEURISTICS
1998
13 years 9 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
WAOA
2005
Springer
14 years 3 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
STACS
2007
Springer
14 years 4 months ago
2007
Springer
DAC
2005
ACM
14 years 10 months ago
2005
ACM
Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically impact both size and perf...