5595 search results - page 378 / 1119 » Approximation Algorithms for Clustering Problems |
192
click to vote
STOC
2009
ACM
16 years 8 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
196
click to vote
PRICAI
2004
Springer
16 years 19 days ago
2004
Springer
Processes that simulate natural phenomena have successfully been applied to a number of problems for which no simple mathematical solution is known or is practicable. Such meta-heu...
177
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
223
click to vote
APPROX
2011
Springer
14 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...
206
click to vote
ICCAD
1993
IEEE
15 years 11 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...