
Complexity of determining the most vital elements for the 1-median and 1-center location problems
Bazgan, Cristina; Toubaline, Sónia; Vanderpooten, Daniel (2010), Complexity of determining the most vital elements for the 1-median and 1-center location problems, in Wu, Weili, Combinatorial Optimization and Combinatorial Optimization and Applications4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I, Springer : Berlin Heidelberg, p. 237-251. http://dx.doi.org/10.1007/978-3-642-17458-2_20
View/ Open
Type
Communication / ConférenceDate
2010Conference country
UNITED STATESBook title
Combinatorial Optimization and Combinatorial Optimization and Applications4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part IBook author
Wu, WeiliPublisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-642-17457-5
Pages
237-251
Publication identifier
Metadata
Show full item recordAbstract (EN)
We consider the k most vital edges (nodes) and min edge (node) blocker versions of the 1-median and 1-center location problems. Given a weighted connected graph with distances on edges and weights on nodes, the k most vital edges (nodes) 1-median (respectively 1-center) problem consists of finding a subset of k edges (nodes) whose removal from the graph leads to an optimal solution for the 1-median (respectively 1-center) problem with the largest total weighted distance (respectively maximum weighted distance). The complementary problem, min edge (node) blocker 1-median (respectively 1-center), consists of removing a subset of edges (nodes) of minimum cardinality such that an optimal solution for the 1-median (respectively 1-center) problem has a total weighted distance spectively a maximum weighted distance) at least as large as a specified threshold. We show that k most vital edges 1-median and k most vital edges 1-center are NP-hard to approximate within a factor 7 − and 4 − respectively, for any > 0, while k most 5 3 vital nodes 1-median and k most vital nodes 1-center are NP-hard to approximate within a factor 3 − , for any > 0. We also show that the 2 complementary versions of these four problems are NP-hard to approx imate within a factor 1.36.Subjects / Keywords
1-median; 1-center; complexity; most vital edges and nodes; approximationRelated items
Showing items related by title and author.
-
Bazgan, Cristina; Toubaline, Sónia; Vanderpooten, Daniel (2013) Article accepté pour publication ou publié
-
Bazgan, Cristina; Toubaline, Sónia; Vanderpooten, Daniel (2012) Article accepté pour publication ou publié
-
Bazgan, Cristina; Toubaline, Sónia; Vanderpooten, Daniel (2011) Communication / Conférence
-
Bazgan, Cristina; Toubaline, Sónia; Vanderpooten, Daniel (2013) Article accepté pour publication ou publié
-
Bazgan, Cristina; Toubaline, Sónia; Vanderpooten, Daniel (2013) Article accepté pour publication ou publié