Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
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
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
Conference paper
Isotropic treatment of EMF effects in advanced photomasks
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
Fernando Martinez, Juntao Chen, et al.
AAAI 2025