SODA
2012
ACM
12 years 1 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
SODA
2012
ACM
12 years 1 months ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
SODA
2012
ACM
12 years 1 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...
SODA
2012
ACM
12 years 1 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...
SODA
2012
ACM
12 years 1 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...
SODA
2012
ACM
12 years 1 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...
SODA
2012
ACM
12 years 1 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...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...