Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 90C60 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6197003
@@ Property / zbMATH DE Number: 6197003 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+most vital edges/nodes
@@ Property / zbMATH Keywords: most vital edges/nodes / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+min edge/node blocker
@@ Property / zbMATH Keywords: min edge/node blocker / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum spanning tree
@@ Property / zbMATH Keywords: minimum spanning tree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complexity
@@ Property / zbMATH Keywords: complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation
@@ Property / zbMATH Keywords: approximation / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-011-9449-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2062808512
@@ Property / OpenAlex ID: W2062808512 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem
+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 @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Finding the most vital edge with respect to minimum spanning tree in weighted graphs
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding the most vital edge of a minimum spanning tree
+Normal rank
@@ Property / cites work @@
+On short paths interdiction problems: Total and node-wise limited interdiction
+Normal rank
@@ Property / cites work @@
+Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
+Normal rank
@@ Property / cites work @@
+Finding the k most vital edges in the minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A faster computation of the most vital edge of a shortest path
+Normal rank
@@ Property / cites work @@
+Finding the <i>n</i> Most Vital Links in Flow Networks
+Normal rank
@@ Property / cites work @@
+Finding the \(k\) most vital edges with respect to minimum spanning tree
+Normal rank
@@ Property / cites work @@
+Removing Arcs from a Network
@@ Property / cites work: Removing Arcs from a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:358656