Sciweavers

59 search results - page 8 / 12
» soda 2003
Sort
View
SODA
2003
ACM
107views Algorithms» more  SODA 2003»
14 years 11 months ago
Fault-tolerant facility location
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
Chaitanya Swamy, David B. Shmoys
SODA
2003
ACM
100views Algorithms» more  SODA 2003»
14 years 11 months ago
Quantum algorithms for some hidden shift problems
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
Wim van Dam, Sean Hallgren, Lawrence Ip
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
14 years 11 months ago
Zonotopes as bounding volumes
Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
Leonidas J. Guibas, An Nguyen, Li Zhang
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
14 years 11 months ago
Deterministic identity testing for multivariate polynomials
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
Richard J. Lipton, Nisheeth K. Vishnoi
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
14 years 11 months ago
Certifying and repairing solutions to large LPs how good are LP-solvers?
State-of-the-art linear programming (LP) solvers give solutions without any warranty. Solutions are not guaranteed to be optimal or even close to optimal. Of course, it is general...
Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, K...