Skip to main content
SpringerLink
Log in

A Stochastic Location Problem with Applications to Tele-diagnostic

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 2004)

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

Included in the following conference series:

  • 1378 Accesses

Abstract

In this paper we study a stochastic location problem with applications to tele-diagnostic, locating the boundaries between polynomiality and NP-completeness, and providing efficient approximation algorithms.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Abrams, M., Standridge, C.R., Abdulla, G., Williams, S., Fox, E.A.: Caching proxies: Limitations and potentials. In: Proceedings of the Fourth International World Wide Web Conference, Boston, MA, December 1995, pp. 119–133 (1995)

    Google Scholar 

  2. Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 378–388. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  3. Hamacher, H.W., Nickel, S.: Classification of location models. Location Science 6, 229–242 (1998)

    Article  Google Scholar 

  4. Handler, G.Y., Mirchandani, P.B.: Location on Networks: Theory and Algorithms. M.I.T. Press, Cambridge (1979)

    MATH  Google Scholar 

  5. Jucker, J.V., Carlson, R.C.: The simple plant-location problem under uncertainty. Operations Res. 24, 1045–1055 (1977)

    Article  MATH  Google Scholar 

  6. Kamal, J., Vazirani, V.V.: Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48(2), 274–296 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kavir, O., Hakimi, S.L.: The p-median problems. An Algorithmic Approach to Network Location Problems. SIAM Journal on Applied Mathematics, Philadelphia 37, 539–560 (1979)

    Google Scholar 

  8. Laporte, G., Louveaux, F.V., Mercure, H.: Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. 39(1), 71–78 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  9. Louveaux, F.V.: Discrete stochastic location models. Annals of Operations Research 6(4), 23–34 (1986)

    Google Scholar 

  10. Louveaux, F.V., Peeters, D.: A dual-based procedure for stochastic facility location. Oper. Res. 40(3), 564–573 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Love, R.F., Morris, J.G., Wesolowsky, G.O.: Facilities Location: Models and Methods. North Holland, New York (1988)

    MATH  Google Scholar 

  12. Mirchandani, P.B., Francis, R.L.: Discrete Location Theory. John Wiley and Sons, Inc., New York (1990)

    MATH  Google Scholar 

  13. Nickel, S.: Discrete and Network Location Theory. Lecture Notes, Fachbereich Mathematik, Universität Kaiserslautern (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Statistica, Probabilità, e Statistiche Applicate, Università di Roma “La Sapienza”, P.le A. Moro 5, 00185, Rome, Italy

    Nicola Apollonio

  2. Istituto per le Applicazioni del Calcolo “M. Picone”, Viale del Policlinico, 137, 00161, Rome, Italy

    Massimiliano Caramia

  3. Dipartimento di Informatica, Sistemi e Produzione, University of Rome “Tor Vergata”, Via del Politecnico, 1, 00133, Rome, Italy

    Giuseppe F. Italiano

Authors
  1. Nicola Apollonio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Massimiliano Caramia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giuseppe F. Italiano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, ETH Zurich, ETH Zentrum, CH-8022, Zurich, Switzerland

    Juraj Hromkovič

  2. Department of Computer Science, RWTH Aachen, Chair of Computer Science III, Aachen, Germany

    Manfred Nagl

  3. Department of Computer Science III, RWTH Aachen University, Ahornstra{ß}e 55, 52074, Aachen, Germany

    Bernhard Westfechtel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Apollonio, N., Caramia, M., Italiano, G.F. (2004). A Stochastic Location Problem with Applications to Tele-diagnostic. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2004. Lecture Notes in Computer Science, vol 3353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30559-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30559-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24132-4

  • Online ISBN: 978-3-540-30559-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation