Multicast Pull Scheduling: When Fairness Is Fine (English)
- New search for: Edmonds
- New search for: Pruhs
- New search for: Edmonds
- New search for: Pruhs
In:
Algorithmica
;
36
, 3
;
315-330
;
2003
- Article (Journal) / Electronic Resource
-
Title:Multicast Pull Scheduling: When Fairness Is Fine
-
Contributors:
-
Published in:Algorithmica ; 36, 3 ; 315-330
-
Publisher:
- New search for: Springer-Verlag
-
Place of publication:Berlin/Heidelberg
-
Publication date:2003-07-01
-
Size:16 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 36, Issue 3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 207
-
ForewordAlbers et al. | 2003
- 209
-
Dynamic TCP Acknowledgment and Other Stories about e/(e - 1)Karlin / Kenyon / Randall et al. | 2003
- 225
-
Competitive On-Line Switching PoliciesBar-Noy / Freund / Landa / Naor et al. | 2003
- 249
-
Static Optimality and Dynamic Search-Optimality in Lists and TreesBlum / Chawla / Kalai et al. | 2003
- 261
-
New Bounds for Multidimensional PackingSeiden / van Stee et al. | 2003
- 295
-
Temporary Tasks Assignment ResolvedArmon / Azar / Epstein / Regev et al. | 2003
- 315
-
Multicast Pull Scheduling: When Fairness Is FineEdmonds / Pruhs et al. | 2003