44 search results - page 5 / 9 » SODA 2012 |
SODA
2012
ACM
11 years 9 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
SODA
2012
ACM
11 years 9 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
11 years 9 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
11 years 9 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
11 years 9 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...