Article ID: | iaor19971133 |
Country: | Netherlands |
Volume: | 69 |
Issue: | 2 |
Start Page Number: | 269 |
End Page Number: | 309 |
Publication Date: | Aug 1995 |
Journal: | Mathematical Programming (Series A) |
Authors: | Hochbaum Dorit S., Hong Sung-Pil |
The authors present new strongly polynomial algorithms for special cases of convex separable quadratic minimization over submodular constraints. The main results are: an O(