Publikationsansicht

Distributed algorithms for multicommodity flow problems via approximate steepest descent framework (2007)

P. Klein,
F. T. Leighton,
F. Makedon,
C. Stein,
C. Stein,
S. Tragoudas,
S. Plotkin,
S. Plotkin,
S. Plotkin,
D. B. Shmoys,
F. Shahrokhi,
D. W. Matula,
The J. Assoc

Abstract

E. Tardos. Fast approximation algorithms fpr fractional packing and covering problems. In FOCS '91. [9] S.K. Sahni. Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach.,

Details der Publikation

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.23.6012
Quelle	http://www.cs.technion.ac.il/~rabani/pss/236521.95.wi/handout8.ps.gz
Mitarbeiter	CiteSeerX
Archiv	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Typ	text
Sprache	Englisch
Verknüpfungen	10.1.1.49.2649, 10.1.1.4.1960, 10.1.1.83.8312, 10.1.1.38.7573, 10.1.1.51.7391, 10.1.1.2.2035, 10.1.1.127.8721, 10.1.1.119.4111, 10.1.1.120.1833, 10.1.1.80.9372, 10.1.1.76.5974, 10.1.1.31.854, 10.1.1.137.7029, 10.1.1.79.4416, 10.1.1.80.3334, 10.1.1.130.7394, 10.1.1.137.4504