Skip to main content
Springer Nature Link
Log in

Optimal information delivery

  • Session 6
  • Conference paper
  • First Online:
Algorithms and Computations (ISAAC 1995)

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

Included in the following conference series:

  • 174 Accesses

Abstract

Minimizing transmission and storage costs for delivering large amounts of data at specific locations and times is an important aspect of video-on-demand applications. We formulate a broad class of optimization problems of this sort as Steiner tree problems in a time-space product graph. We show that the general problem is NP-complete, we develop a polynomial-time algorithm for an important special case, and a fast heuristic that achieves an approximation ratio of two. Experimental results suggest that the heuristic is usually within a few percentage points of the optimum.

Research supported by an NSF grant and by the Greek Ministry of Research program ∏ENEΔ-91Δ648.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. M. Karp “Reducibility among Computational Problems,” in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher (eds.), Plenum 1972.

    Google Scholar 

  2. S. Loeb “Architecting Personalized Delivery of Multimedia Information,” Comm. ACM, 35, 12, pp. 39–48, 1992.

    Google Scholar 

  3. C. H. Papadimitriou, S. Ramanathan, and P. V. Rangan “Information Caching for Delivery of Personalized Video Programs on Home Entertainment Channels”, Proceedings of the IEEE International Conference on Multimedia Computing and Systems, May 15–19, 1994, Boston.

    Google Scholar 

  4. C. H. Papadimitriou, S. Ramanathan, P. V. Rangan, and S. Sampathkumar “Multimedia Information Caching for Personalized Video-on-Demand”, Computer Communications, (to appear).

    Google Scholar 

  5. C. H. Papadimitriou, K. Steiglitz Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1982.

    Google Scholar 

  6. A. Z. Zelikovski “An 11/6-approximation Algorithm for Steiner Trees”, Algorithmica, 9, 5, pp. 463–470, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California at San Diego, USA

    Christos H. Papadimitriou, Srinivas Ramanathan & P. Venkat Rangan

Authors
  1. Christos H. Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Srinivas Ramanathan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Venkat Rangan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Staples Peter Eades Naoki Katoh Alistair Moffat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papadimitriou, C.H., Ramanathan, S., Venkat Rangan, P. (1995). Optimal information delivery. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015422

Download citation

  • DOI: https://doi.org/10.1007/BFb0015422

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60573-7

  • Online ISBN: 978-3-540-47766-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation