Journal of Combinatorial Optimization

, Volume 25, Issue 2, pp 191–207 | Cite as

Complexity of determining the most vital elements for the p-median and p-center location problems

  • Cristina Bazgan
  • Sonia Toubaline
  • Daniel Vanderpooten
Article

Abstract

We consider the k most vital edges (nodes) and min edge (node) blocker versions of the p-median and p-center location problems. Given a weighted connected graph with distances on edges and weights on nodes, the k most vital edges (nodes) p-median (respectively p-center) problem consists of finding a subset of k edges (nodes) whose removal from the graph leads to an optimal solution for the p-median (respectively p-center) problem with the largest total weighted distance (respectively maximum weighted distance). The complementary problem, min edge (node) blocker p-median (respectively p-center), consists of removing a subset of edges (nodes) of minimum cardinality such that an optimal solution for the p-median (respectively p-center) problem has a total weighted distance (respectively a maximum weighted distance) at least as large as a specified threshold. We show that k most vital edges p-median and k most vital edges p-center are NP-hard to approximate within a factor \(\frac{7}{5}-\epsilon\) and \(\frac{4}{3}-\epsilon\) respectively, for any ϵ>0, while k most vital nodes p-median and k most vital nodes p-center are NP-hard to approximate within a factor \(\frac{3}{2}-\epsilon\), for any ϵ>0. We also show that the complementary versions of these four problems are NP-hard to approximate within a factor 1.36.

Keywords

Most vital edges and nodes Min edge and node blocker p-median p-center Complexity Approximation 

References

  1. Arora S, Lund C (1996) Hardness of approximations. In: Approximation algorithms for NP-hard problems. PWS Publishing Company, Boston, pp 399–446 Google Scholar
  2. Bar-Noy A, Khuller S, Schieber B (1995) The complexity of finding most vital arcs and nodes. Technical Report CS-TR-3539, University of Maryland Google Scholar
  3. Bazgan C, Toubaline S, Tuza Zs (2010) Complexity of most vital nodes for independent set on tree structures. In: Proceedings of the 21st international workshop on combinatorial algorithms (IWOCA 2010). LNCS, vol 6460, pp 154–166 CrossRefGoogle Scholar
  4. Brooks RL (1941) On colouring the nodes of a network. Math Proc Camb Philos Soc 37(2):194–197 MathSciNetCrossRefGoogle Scholar
  5. Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439–485 MathSciNetMATHCrossRefGoogle Scholar
  6. Frederickson GN, Solis-Oba R (1996) Increasing the weight of minimum spanning trees. In: Proceedings of the 7th ACM-SIAM symposium on discrete algorithms (SODA 1996), pp 539–546 Google Scholar
  7. Garey MR, Johnson DS, Stockmeyer L (1976) Some simplified NP-complete graph problems. Theor Comput Sci 1(3):237–267 MathSciNetMATHCrossRefGoogle Scholar
  8. Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V, Rudolf G, Zhao J (2008) On short paths interdiction problems: total and node-wise limited interdiction. Theory Comput Syst 43(2):204–233 MathSciNetCrossRefGoogle Scholar
  9. Khanna S, Motwani R, Sudan M, Vazirani U (1994) On syntactic versus computational views of approximability. In: Proceedings of the 35th annual IEEE symposium on foundations of computer science (FOCS 1994), pp 819–830. Also published in SIAM J Comput 28(1):164–191 (1999) CrossRefGoogle Scholar
  10. Ries B, Bentz C, Picouleau C, de Werra D, Costa M, Zenklusen R (2010) Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discrete Math 310(1):132–146 MathSciNetMATHCrossRefGoogle Scholar
  11. Wood RK (1993) Deterministic network interdiction. Math Comput Model 17(2):1–18 MATHCrossRefGoogle Scholar
  12. Zenklusen R, Ries B, Picouleau C, de Werra D, Costa M, Bentz C (2009) Blockers and transversals. Discrete Math 309(13):4306–4314 MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Cristina Bazgan
    • 1
    • 2
  • Sonia Toubaline
    • 1
  • Daniel Vanderpooten
    • 1
  1. 1.LAMSADEUniversité Paris-DauphineParis Cedex 16France
  2. 2.Institut Universitaire de FranceParisFrance

Personalised recommendations