We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
For multi-criteria problems and problems with poorly characterized objective, it is often desirable to simultaneously approximate the optimum solution for a large class of objecti...
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...