A robust min-cut improvement algorithm based on dynamic look-ahead weighting.

Published in: ASP-DAC (1995)

Keyphrases

dynamic programming
k means
segmentation algorithm
min cut
np hard
worst case
matching algorithm
similarity measure
objective function
optimal solution
probabilistic model
simulated annealing
linear programming
particle swarm optimization