Approximating a solution of the s-t max-cut problem with a deterministic annealing algorithm

Chuangyin Dang. Approximating a solution of the s-t max-cut problem with a deterministic annealing algorithm. Neural Networks, 13(7):801-810, 2000. [doi]

Abstract

Abstract is missing.