79 search results - page 11 / 16 » Improved approximation algorithms for multidimensional bin p... |
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
79
Voted
MOBIQUITOUS
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
57
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...
78
Voted
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...