Login / Signup
About strongly polynomial time algorithms for quadratic optimization over submodular constraints.
Dorit S. Hochbaum
Sung-Pil Hong
Published in:
Math. Program. (1995)
Keyphrases
</>
quadratic optimization
learning algorithm
computational complexity
worst case
special case
data sets
greedy algorithm