478 search results - page 15 / 96 » Approximation algorithms for general packing problems and th... |
AIPS
2003
13 years 10 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
BICOB
2009
Springer
14 years 3 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
JSAC
2006
13 years 8 months ago
2006
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...