Skip to main content

Advertisement

Springer Nature Link
Log in

On alternativep-center problems

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

LetG=(V, E) be an undirected connected graph with positive edge lengths. The vertexp-center problem is to find the optimal location ofp centers so that the maximum distance to a vertex from its nearest center is minimized, where the centers may be placed at the vertices. Kariv and Hakimi have shown that this problem is NP-hard. We will consider two modifications of this problem in which each center may be located in one of two predetermined vertices. We will show the NP-completeness of their recognition versions.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Christofides N, Viola P (1971) The optimal location of multicenters on a graph, Oper. Res. Quart. 22:145–154

    Google Scholar 

  2. Cuninghame-Green RA (1984) The absolute centre of a graph, Discr. Appl. Math. 7:275–283

    Google Scholar 

  3. Garey MR, Johnson DS (1979) Computers and intractability, Freeman WH and Company, San Francisco

    Google Scholar 

  4. Karp RM (1972) Reducibilities among combinatorial problems, in “Complexity of computer computations”, Miller RE, Thatcher JW (eds), Plenum 83–95

  5. Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems I: The p-centers, SIAM J. Appl. Math. 3:513–538

    Google Scholar 

  6. Masuyama S, Ibaraki T, Hasegawa T (1981) The computational complexity of them-center problems on the plane, The Trans. of the IECE of Japan 2:57–64

    Google Scholar 

  7. Megiddo N, Supowit KJ (1984) On the complexity of some common geometric location problems, SIAM J. on Comp. 1:182–196

    Google Scholar 

  8. Megiddo N, Tamir A (1983) New results on the complexity ofp-center problems, SIAM J. on Comp. 4:751–758

    Google Scholar 

  9. Minieka E (1977) The centers and medians of a graph, Oper. Res. 4:641–650

    Google Scholar 

  10. Plesník J (1980) On the computational complexity of centers locating in a graph, Aplikace matematiky 6:445–452

    Google Scholar 

  11. Sedgewick R (1988) Algorithms, Addison-Wesley publ. Company

  12. Tamir A (1985) A finite algorithm for the continuousp-center location problem on a graph, Math. Progr. 31:298–306

    Google Scholar 

  13. Tamir A (1987) On the solution value of the continuousp-center location problem on a graph, Math. of Oper. Res. Vol. 12, 2:340–349

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vysoka skola Technicka, Katedra Maternatiky, Letná 9, 04000, Kosice, Czechoslovakia

    O. Hudec

Authors
  1. O. Hudec
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hudec, O. On alternativep-center problems. ZOR - Methods and Models of Operations Research 36, 439–445 (1992). https://doi.org/10.1007/BF01415760

Download citation

  • Received:

  • Issue Date:

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

Keywords