9 search results - page 1 / 2 » A 1.5-approximation algorithm for augmenting edge-connectivi... |
IPL
2011
12 years 11 months ago
2011
ECCV
2010
Springer
13 years 1 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
ANTSW
2004
Springer
13 years 8 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...