1433 search results - page 45 / 287 » On Covering Problems of Rado |
176
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
222
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...
155
click to vote
FOSSACS
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
162
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
159
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...