Approximate spanning cactus (Q2353648): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2015.06.009
+Normal rank
@@ Property / OpenAlex ID @@
+W929930557
@@ Property / OpenAlex ID: W929930557 / rank @@
+Normal rank
@@ Property / cites work @@
+On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
+Normal rank
@@ Property / cites work @@
+Performance guarantees for the TSP with a parameterized triangle inequality
+Normal rank
@@ Property / cites work @@
+Q4503938
@@ Property / cites work: Q4503938 / rank @@
+Normal rank
@@ Property / cites work @@
+The Min-Max Spanning Tree Problem and some extensions
+Normal rank
@@ Property / cites work @@
+The connectivity carcass of a vertex subset in a graph and its incremental maintenance
+Normal rank
@@ Property / cites work @@
+-Approximation algorithm for bottleneck disjoint path matching
+Normal rank
@@ Property / cites work @@
+Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
+Normal rank
@@ Property / cites work @@
+Spanning cactus of a graph: Existence, extension, optimization, and approximation
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Complexity of the directed spanning cactus problem
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank