3875 search results - page 55 / 775 » Approximation algorithms for the 0-extension problem |
85
Voted
STOC
2003
ACM
15 years 10 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...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
SIAMCO
2000
14 years 9 months ago
2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
94
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph