Distributed Approximation Algorithms via LP-Duality and Randomization

Authored by: Devdatt Dubhashi , Fabrizio Grandoni , Alessandro Panconesi

Handbook of Approximation Algorithms and Metaheuristics, Second Edition

Print publication date:  May  2018
Online publication date:  May  2018

Print ISBN: 9781498770118
eBook ISBN: 9781351236423
Adobe ISBN:

10.1201/9781351236423-12

 Download Chapter

 

Abstract

The spread of computer networks, from sensor networks to the Internet, creates an ever growing need for efficient distributed algorithms. In such scenarios, familiar combinatorial structures such as spanning trees and dominating sets are often useful for a variety of tasks. Others, like maximal independent sets, turn out to be a very useful primitive for computing other structures. In a distributed setting, where transmission of messages can be orders of magnitude slower than local computation, the expensive resource is communication. Therefore, the running time of an algorithm is given by the number of communication rounds that are needed by the algorithm. This will be made precise in the following text.

 Cite
Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.