D.S. Turaga, K. Ratakonda, et al.
SCC 2006
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.
D.S. Turaga, K. Ratakonda, et al.
SCC 2006
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
T. Graham, A. Afzali, et al.
Microlithography 2000
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems