Conference paper
Surface light-induced changes in thin polymer films
Andrew Skumanich
SPIE Optics Quebec 1993
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.
Andrew Skumanich
SPIE Optics Quebec 1993
Heng Cao, Haifeng Xi, et al.
WSC 2003
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence