Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
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.
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
James Lee Hafner
Journal of Number Theory