Circular arrangements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 1054-1065

  Liberatore, Vincenzo ^a  

^a Case Western Reserve University   (United States)

Author keywords

Approximation algorithms; Broadcast disks; Combinatorial optimization; Multicast; Scheduling

Indexed keywords

AUTOMATA THEORY; COMBINATORIAL OPTIMIZATION; MULTICASTING; POLYNOMIAL APPROXIMATION; SCHEDULING;

ARC LENGTH; BROADCAST DISKS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; SCHEDULING PROBLEM; WEB SERVER LOGS; WEIGHTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 84869193453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_90     Document Type: Conference Paper

References (26)

1. http://www.digitalfountain.com/.
2. http://www.hns.com/.
3. http://www.panamsat.com/.
4. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows. Prentice Hall Inc., Englewood Cliffs, NJ, 1993. Theory, algorithms, and applications.
5. K. C. Almeroth, M. H. Ammar, and Z. Fei. Scalable delivery of Web pages using cyclic best-effort (UDP) multicast. In Proceedings of the Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFO-COM 1998), 1998.
6. Martin Arlitt and Tai Jin. Workload characterization of the 1998 World Cup web site. Technical Report HPL-1999-35R1, HP Labs, 1999.
7. Sanjeev Arora, Alan Frieze, and Haim Kaplan. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. In 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pages 21-30. IEEE Comput. Sec. Press, Los Alamitos, CA, 1996.
8. Kenneth R. Baker. Introduction to sequencing and scheduling. Wiley, New York, 1974.
9. John W. Byers, Michael Luby, Michael Mitzenmacher, and Ashutosh Rege. A digital fountain approach to reliable distribution of bulk data. In Proc. Sigcomm, 1998.
10. C. K. Cheng and T. C. Hu. Ancestor tree for arbitrary multi-terminal cut functions. Ann. Oper. Res., 33(1-4):199-213, 1991.
11. Topological network design (Copenhagen, 1989).
12. Panos K. Chrysanthis, Vincenzo Liberatore, and Kirk Pruhs. Middleware support for multicast-based data dissemination: A working reality. White Paper, 2001.
13. William W. Cohen, Robert E. Schapire, and Yoram Singer. Learning to Order things. Journal of Artificial Intelligence Research, 10:243-270, 1999.
14. G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(2):151-174, 1998.
15. Guy Even, Joseph (Seffi) Naor, Satish Rao, and Baruch Schieber. Divide-andconquer approximation algorithms via spreading metrics. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 62-71, October 1995.
16. Michael R. Garey and David S. Johnson. Computers and intractability. W. H. Freeman and Co., San Francisco, Calif., 1979. A guide to the theory of NPcompleteness, A Series of Books in the Mathematical Sciences.
17. L. G. Hačijan. A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR, 244(5):1093-1096, 1979.
18. Gary Herman, Gita Gopal, K. C. Lee, and Abel Weinrib. The datacycle architecture for very high throughput database systems. In Proceedings of the 1987 ACM SIGMOD Conference International Conference on Management of Data, pages 97-103, 1987.
19. V. Kann. On the Approximability of NP-complete Optimization Problems. PhD thesis, Royal Institute of Technology, Stockholm, 1992.
20. Claire Kenyon, Nicolas Schabanel, and Neal Young. Polynomial-time approximation scheme for data broadcast. In Proceedings of the Thirtisecond ACM Symposium on the Theory of Cornputing, 2000.
21. Sanjeev Khanna and Vincenzo Liberatore. On broadcast disk paging. SIAM Journal on Computing, 29(5):1683-1702, 2000.
22. Tom Leighton and Satish Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
23. Vincenzo Liberatore. Multicast scheduling for list requests. In 2lst Annual Joint Conference of the IEEE Computer und Communications Societies (INFOCOM 2002), 2002. To appear.
24. Larry L. Peterson and Bruce S. Davie. Computer Networks. Morgan Kaufmann, 2000.
25. Satish Rao and Andréa W. Richa. New approximation techniques for some ordering Problems. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1998), pages 211-218, New York, 1998. ACM.
26. W. Richard Stevens. Unix Network Programming. PTR PH, 1998.