356 search results - page 33 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
ICIC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal qu...
ICALP
2001
Springer
14 years 10 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...