909 search results - page 1 / 182 » On the approximability of some network design problems |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
TALG
2008
13 years 4 months ago
2008
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
JGAA
2000
13 years 4 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
CIAC
2003
Springer
13 years 8 months ago
2003
Springer
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...