Approximating Some Network Design Problems with Node Costs

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 which we are given a graph

• Type: Conference
• Year: 2009
• Where: APPROX
• Authors: Guy Kortsarz, Zeev Nutov
• Keywords: Algorithms, APPROX 2009, Chekuri Et, Multi-criteria Undirected Network, Problems