136 search results - page 22 / 28 » A Constant-Factor Approximation Algorithm for the k-Median P... |
145
click to vote
WAOA
2010
Springer
15 years 26 days ago
2010
Springer
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
114
click to vote
SODA
2010
ACM
16 years 12 days ago
2010
ACM
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
137
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
113
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
113
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...