Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems-Reference-Cited by-同舟云学术

Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems

Published:2010 Issue: Volume: Page:237-251
ISSN:0302-9743
Container-title:Combinatorial Optimization and Applications
language:
Short-container-title:

Author:

Bazgan Cristina,Toubaline Sonia,Vanderpooten Daniel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-17458-2_20

Reference13 articles.

1. Arora, S., Lund, C.: Hardness of approximations. In: Approximation Algorithms for NP-hard Problems, pp. 399–446. PWS Publishing Company (1996)

2. Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes. Technical Report CS-TR-3539, Department of Computer Science, University of Maryland (1995)

3. Bazgan, C., Toubaline, S., Tuza, Z.: Complexity of most vital nodes for independent set in graphs related to tree structures. In: Proceedings of the 21 st International Workshop on Combinatorial Algorithms (IWOCA 2010). Springer, Heidelberg (2010) (to appear in LNCS)

4. Brooks, R.L.: On colouring the nodes of a network. Mathematical Proceeing of the Cambridge Philosophical Society 37(2), 194–197 (1941)

5. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162(1), 439–485 (2005)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An FPTAS for Connectivity Interdiction;Lecture Notes in Computer Science;2024

2. Integer programming methods for solving binary interdiction games;European Journal of Operational Research;2022-10

3. On the hardness of covering-interdiction problems;Theoretical Computer Science;2021-06

4. Interdicting facilities in tree networks;TOP;2021-05-10

5. Integer Programming Formulations for Minimum Spanning Tree Interdiction;INFORMS Journal on Computing;2021-03-04