Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph (Q5346544): Difference between revisions

@@ Property / cites work @@
+A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
+Normal rank
@@ Property / cites work @@
+Finding 2-Factors Closer to TSP Tours in Cubic Graphs
+Normal rank
@@ Property / cites work @@
+Q3840351
@@ Property / cites work: Q3840351 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
+Normal rank
@@ Property / cites work @@
+Q4828917
@@ Property / cites work: Q4828917 / rank @@
+Normal rank
@@ Property / cites work @@
+On the relationship between the biconnectivity augmentation and traveling salesman problems
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/16m1057486
+Normal rank
@@ Property / OpenAlex ID @@
+W2600683609
@@ Property / OpenAlex ID: W2600683609 / rank @@
+Normal rank