Approximating max-min linear programs with local algorithms

A local algorithm is a distributed algorithm where each node must operate solely based on the information that was available at system startup within a constant-size neighbourhood of the node. We study the applicability of local algorithms to max-min LPs where the objective is to maximise min k Sigm...

Celý popis

Podrobná bibliografia

Vydané v:	2008 IEEE International Symposium on Parallel and Distributed Processing s. 1 - 10
Hlavní autori:	Floreen, P., Kaski, P., Musto, T., Suomela, J.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.04.2008
Predmet:	Algorithm design and analysis Approximation algorithms Circuits Communication networks Computational modeling Computer science Distributed algorithms Distributed decision making Information technology Linear approximation
ISBN:	1424416930, 9781424416936
ISSN:	1530-2075
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!