Skip to main content
SpringerLink
Log in

When are NP-hard location problems easy?

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We discuss in this paper several location problems for which it is an NP-hard problem to find an approximate solution. Given certain assumptions on the input distributions, we present polynomial algorithms that deliver a solution asymptotically close to the optimum with probability that is asymptotically one (the exact nature of this asymptotic convergence is described in the paper). In that sense the subproblems defined on the specified family of inputs are in fact easy.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M.L. Fisher and D.S. Hochbaum, Probabilistic analysis of the planark-median problem, MOR 5:1 February, 1980) 27.

    Google Scholar 

  2. A.M. Frieze, Probabilistic analysis of some Euclidean clustering problems, Discr. Appl. Math. 2(1980)295.

    Google Scholar 

  3. D.S. Hochbaum, Easy solutions for thek-center problem on the dominating set problem on random graphs, Annals of Discr. Math., to appear.

  4. D.S. Hochbaum, Heuristics for the fixed cost median problem, Math. Progr. 22(1982)148.

    Google Scholar 

  5. D.S. Hochbaum and J.M. Steele, Steinhaus's geometric location problem for random samples in the plane, Adv. Appl. Prob. 14(1982)56.

    Google Scholar 

  6. R.M. Karp, The probabilistic analysis of some combinatorial search algorithms, in: Algorithms and Complexity: New Directions and Recent Results (Academic Press, 1976) p. 1.

  7. R.M. Karp, Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane, Math. Oper. Res. 2(1977)209.

    Google Scholar 

  8. A. Marchetti-Spaccamela and M. Talamo, Probabilistic analysis of two Euclidean location problems, Tech. Rep. (IST. Automatica, Roma, Italy, July 1982).

    Google Scholar 

  9. C.H. Papadimitriou, Worst case analysis of a geometric location problem. SIAM J. Comput. 10:3(1981)542.

    Google Scholar 

  10. E. Zemel, Probabilistic analysis of geometric location problems (Northwestern University, 1982) unpublished manuscript.

Download references

Author information

Authors and Affiliations

  1. School of Business Administration, University of California, 350 Barrows Hall, 94720, Berkeley, California, USA

    Dorit S. Hochbaum

Authors
  1. Dorit S. Hochbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by the National Science Foundation under grant ECS-8204695.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hochbaum, D.S. When are NP-hard location problems easy?. Ann Oper Res 1, 201–214 (1984). https://doi.org/10.1007/BF01874389

Download citation

  • Issue Date:

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

Keywords and phrases

Search

Navigation