Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems (Q1944389): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-012-9469-8
@@ Property / DOI: 10.1007/s10878-012-9469-8 / rank @@
-Normal rank
@@ Property / cites work @@
+Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Q4875228
@@ Property / cites work: Q4875228 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+On short paths interdiction problems: Total and node-wise limited interdiction
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
+Normal rank
@@ Property / cites work @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Blockers and transversals
@@ Property / cites work: Blockers and transversals / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-012-9469-8
@@ Property / DOI: 10.1007/S10878-012-9469-8 / rank @@
+Normal rank