Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Given a graph with nonnegative edge-weights, let f(k) be the value of an optimal solution of the k-cut problem. We study f as a function of k. Let g be the convex envelope of f. We give a polynomial algorithm to compute g. In particular, if f is convex, then it can be computed in polynomial time for all k. We show some experiments in computing g.
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998