Sciweavers

3341 search results - page 157 / 669
» On Bounded Queries and Approximation
Sort
View
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
15 years 9 months ago
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
Aleksander Madry
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 4 months ago
Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
M. A. Iwen
EOR
2006
104views more  EOR 2006»
15 years 4 months ago
A factor 1/2 approximation algorithm for two-stage stochastic matching problems
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
Nan Kong, Andrew J. Schaefer
JC
2006
68views more  JC 2006»
15 years 4 months ago
Monte Carlo approximation of weakly singular integral operators
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
Stefan Heinrich
MOC
2000
68views more  MOC 2000»
15 years 4 months ago
Numerical approximations of one-dimensional linear conservation equations with discontinuous coefficients
Conservative linear equations arise in many areas of application, including continuum mechanics or high-frequency geometrical optics approximations. This kind of equation admits mo...
Laurent Gosse, François James