Software Engineering White Papers

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

Overview Several problems in the design of communication networks can be modeled as finding a network obeying certain connectivity specifications. For instance, the network may be required to connect all the nodes in the graph (a spanning tree problem), a specified subset of the nodes in the graph (a Steiner tree problem) or to only interconnect a set of pairs of nodes (a generalized Steiner forest problem). The goal in such network-design problems can usually be expressed as minimizing some measure of cost associated with the network. Several examples of such cost measures have been considered in the literature.

Further White Paper Details
PublisherCarnegie Mellon University File FormatPDF
Date PublishedJanuary 2007
FormatWhite Papers   
Topics

Quick Sitemap Links: