1178 search results - page 1 / 236 » An optimal adaptive algorithm for the approximation of conca... |
MP
2006
13 years 5 months ago
2006
SODA
2003
ACM
13 years 6 months ago
2003
ACM
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...
ALGORITHMICA
2006
13 years 5 months ago
2006
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...
SIAMDM
2010
13 years 1 days ago
2010
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 ...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
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 ...