TY  - RPRT
TI  - Approximating a solution of the s-t max-cut problem with a deterministic annealing algorithm.
AU  - C Dang
PY  - 2000
DO  - 10.1016/s0893-6080(00)00064-2
UR  - https://pubmed.ncbi.nlm.nih.gov/11152210/
ID  - 11152210
ER  -