An efficient algorithm for packing cuts and (2, 3)-metrics in a planar graph with three holes.

Alexander V. Karzanov

Published in: Discret. Optim. (2019)

Keyphrases

dynamic programming
computational complexity
k means
expectation maximization
objective function
worst case
maximum likelihood
lower bound
packing problem
planar graphs