Return to search

Approximation Algorithms for Faster Communication and Cheaper Networks Using Linear Programming

As we are currently in the information age, people expect access to information to exist by default. In order to facilitate the communication of knowledge, efficient networks must be built. In particular, the networks must be built satisfying some constraints while minimizing cost or time. These constraints often make these problems NP-hard. In this thesis, we investigate two different sets of problems: communicating information quickly and building cheap networks. In the communication problems, the goal is to minimize the number of rounds of communication. In the network design problems the goal is to construct a network of minimum cost.

Identiferoai:union.ndltd.org:cmu.edu/oai:repository.cmu.edu:dissertations-2089
Date01 August 2017
CreatorsIglesias, Jennifer
PublisherResearch Showcase @ CMU
Source SetsCarnegie Mellon University
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceDissertations

Page generated in 0.0019 seconds