570 search results - page 8 / 114 » Approximating Some Network Design Problems with Node Costs |
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—We consider the problem of designing a network which minimizes the total cost of the switching facilities and the fiber links, by choosing the subset of nodes at which to insta...
WIOPT
2010
IEEE
13 years 6 months ago
2010
IEEE
—In this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes co-exist. We specialize the description of...
DATAMINE
2010
13 years 7 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...