We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
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...
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...