1647 search results - page 6 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
APPROX
2004
Springer
15 years 2 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
100
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
IFIP
2007
Springer
15 years 3 months ago
2007
Springer
100
Voted
STOC
2010
ACM
15 years 2 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...