34 search results - page 6 / 7 » A Branch-and-Reduce Algorithm for Finding a Minimum Independ... |
AIPS
2004
13 years 7 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
FOCS
2009
IEEE
14 years 16 days ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
MOBIHOC
2005
ACM
14 years 5 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
DCC
2006
IEEE
14 years 5 months ago
2006
IEEE
We investigate the optimum transmission strategy that minimizes the overall distortion for delaysensitive but distortion-tolerant data. We consider a set of source symbols residin...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...