Skip to main content
SpringerLink
Log in

Circular Arrangements

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2380))

Included in the following conference series:

Abstract

Motivated by a scheduling problem in multicast environments, we consider the problem of arranging a weighted graph around a circle so as to minimize the total weighted arc length. We describe the first polynomial-time approximation algorithms for this problem, and specifically an O(logn)-approximation algorithm for undirected circular arrangements and a Õ(√n)-approximation algorithm for directed circular arrangements. We will show that a simplification of the latter algorithm has better performance than previous heuristics on graphs obtained from a busy Web server log.

10900 Euclid Avenue, Cleveland, Ohio 44106-7221, USA. Ph: (216) 368 4088, Fax: (216) 368 6039. This work has been supported in part under NSF grant ANI-0123929.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  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.

    Google Scholar 

  6. Martin Arlitt and Tai Jin. Workload characterization of the 1998 World Cup web site. Technical Report HPL-1999-35R1, HP Labs, 1999.

    Google Scholar 

  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.

    Google Scholar 

  8. Kenneth R. Baker. Introduction to sequencing and scheduling. Wiley, New York, 1974.

    Google Scholar 

  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.

    Google Scholar 

  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. Topological network design (Copenhagen, 1989).

    Article  MATH  MathSciNet  Google Scholar 

  11. Panos K. Chrysanthis, Vincenzo Liberatore, and Kirk Pruhs. Middleware support for multicast-based data dissemination: A working reality. White Paper, 2001.

    Google Scholar 

  12. William W. Cohen, Robert E. Schapire, and Yoram Singer. Learning to Order things. Journal of Artificial Intelligence Research, 10:243–270, 1999.

    MATH  MathSciNet  Google Scholar 

  13. G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(2):151–174, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  14. Guy Even, Joseph (Seffi) Naor, Satish Rao, and Baruch Schieber. Divide-and-conquer approximation algorithms via spreading metrics. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 62–71, October 1995.

    Google Scholar 

  15. 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 NP-completeness, A Series of Books in the Mathematical Sciences.

    MATH  Google Scholar 

  16. L. G. Hačijan. A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR, 244(5):1093–1096, 1979.

    MathSciNet  Google Scholar 

  17. 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.

    Google Scholar 

  18. V. Kann. On the Approximability of NP-complete Optimization Problems. PhD thesis, Royal Institute of Technology, Stockholm, 1992.

    Google Scholar 

  19. 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.

    Google Scholar 

  20. Sanjeev Khanna and Vincenzo Liberatore. On broadcast disk paging. SIAM Journal on Computing, 29(5):1683–1702, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  21. 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.

    Article  MATH  MathSciNet  Google Scholar 

  22. Vincenzo Liberatore. Multicast scheduling for list requests. In 2lst Annual Joint Conference of the IEEE Computer und Communications Societies (INFOCOM 2002), 2002. To appear.

    Google Scholar 

  23. Larry L. Peterson and Bruce S. Davie. Computer Networks. Morgan Kaufmann, 2000.

    Google Scholar 

  24. 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.

    Google Scholar 

  25. W. Richard Stevens. Unix Network Programming. PTR PH, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical Engineering and Computer Science Department, Case Western Reserve University, Japan

    Vincenzo Liberatore

Authors
  1. Vincenzo Liberatore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zentrum, ETH Zürich, 8092, Zürich, Switzerland

    Peter Widmayer  & Stephan Eidenbenz  & 

  2. Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Francisco Triguero , Rafael Morales  & Ricardo Conejo ,  & 

  3. School of Cognitive and Computing Sciences, University of Sussex, Falmer, Brighton, BN1 9QN, UK

    Matthew Hennessy

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liberatore, V. (2002). Circular Arrangements. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-45465-9_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43864-9

  • Online ISBN: 978-3-540-45465-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation