Service-Constrained Network Design Problems

Madhav V. Marathe, R. Ravi, Ravi Sundaram

Abstract: Several practical instances of network design problems often require the network to satisfy multiple constraints. In this paper, we focus on the following problem (and its variants): find a low-cost network, under one cost function, that services every node in the graph, under another cost function, (i.e., every node of the graph is within a prespecified distance from the network). This study has important applications to the problems of optical network design and the efficient maintenance of distributed databases.

External IDs:dblp:conf/swat/MaratheRS96