For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
We prove an extrapolation theorem for the nonlinear m-term approximation with respect to a system of functions satisfying very mild conditions. This theorem allows us to prove end...
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
Abstract-- Successful investment management relies on allocating assets so as to beat the stock market. Asset classes are affected by different market dynamics or latent trends. Th...
Ruairi de Frein, Konstantinos Drakakis, Scott Rick...