59 search results - page 4 / 12 » Red-blue covering problems and the consecutive ones property |
SODA
2001
ACM
13 years 8 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
SWAT
2004
Springer
14 years 21 days ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
CPAIOR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...