Service-constrained network design problems
MADHAV V. MARATHE, R. Ravi, Ravi Sundaram · Nordic journal of computing · 1996
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). Such problems find applications in optical network design and the efficient maintenance of distributed databases.We utilize the framework developed in Marathe et al. [1995] co formulate these problems as bicriteria network design problems, and present approximation algorithms for a class of service-constrained network design problems. We also present lower bounds on the approximability of these problems that demonstrate that our performance ratios are close to best possible.