642 search results - page 47 / 129 » Approximation Algorithms for Minimum K-Cut |
108
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
108
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
127
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
122
click to vote
FSTTCS
2001
Springer
15 years 4 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...