1647 search results - page 177 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
133
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
132
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
161
Voted
SIAMJO
2008
15 years 5 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
158
click to vote
SARA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
141
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...