Approximation Algorithms For Minimum-Cost Low-Degree Subgraphs

@inproceedings{Knemann2003ApproximationAF,
  title={Approximation Algorithms For Minimum-Cost Low-Degree Subgraphs},
  author={Jochen K{\"o}nemann},
  year={2003}
}
In this thesis we address problems in minimum-cost low-degree network design. In the design of communication networks we often face the problem of building a network connecting a large number of end-hosts. Available hardware or software often imposes additional restrictions on the topology of the network. One example for such a requirement arises in the area of computer networks: We are given a number of client hosts in a network that communicate with each other using a certain communication… CONTINUE READING