In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...