216 search results - page 24 / 44 » Covering Problems with Hard Capacities |
DM
1998
13 years 7 months ago
1998
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
CPAIOR
2010
Springer
14 years 11 days ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...