570 search results - page 1 / 114 » Approximating Some Network Design Problems with Node Costs |
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...
ESA
2007
Springer
13 years 10 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
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...
COMCOM
2006
13 years 4 months ago
2006
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
INFORMS
2008
13 years 4 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...