19 search results - page 1 / 4 » A Parallel Approximation Algorithm for the Max Cut Problem o... |
ASIAN
1999
Springer
13 years 8 months ago
1999
Springer
DAM
2008
13 years 4 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
MEMICS
2010
12 years 11 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
ECCC
2000
13 years 4 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...