SODA
2012
ACM
11 years 8 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
SODA
2012
ACM
11 years 8 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
SODA
2012
ACM
11 years 8 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 8 months ago
2012
ACM
SODA
2012
ACM
11 years 8 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
SODA
2012
ACM
11 years 8 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...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
Statistical data frequently includes outliers; these can distort the results of estimation procedures and optimization problems. For this reason, loss functions which deemphasize ...