Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Paper
On the k-cut problem
Abstract
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.
Related
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Conference paper
Wavefront and caustic surfaces of refractive laser beam shaper
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering