Article ID: | iaor20084112 |
Country: | Netherlands |
Volume: | 35 |
Issue: | 6 |
Start Page Number: | 739 |
End Page Number: | 742 |
Publication Date: | Nov 2007 |
Journal: | Operations Research Letters |
Authors: | Hong Sung-Pil, Choi Byung-Cheon |
We show that when the number of sources is constant the sparsest cut problem is solvable in polynomial time.