Sciweavers

3415 search results - page 90 / 683
» Lower Bounds for Kernelizations
Sort
View
SODA
1992
ACM
96views Algorithms» more  SODA 1992»
15 years 5 months ago
Lower Bounds for On-Line Graph Coloring
Magnús M. Halldórsson, Mario Szegedy
FOCS
2008
IEEE
15 years 5 months ago
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
Deeparnab Chakrabarty, Gagan Goel