189
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
161
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to e...
183
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
171
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
177
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...