On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542): Difference between revisions

@@ 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.1016/j.tcs.2004.06.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2153849284
@@ Property / OpenAlex ID: W2153849284 / 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 Approximation Algorithms Depending on Parametrized Triangle Inequalities
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Performance guarantees for the TSP with a parameterized triangle inequality
+Normal rank
@@ Property / cites work @@
+Q4449172
@@ Property / cites work: Q4449172 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the TSP with sharpened triangle inequality
+Normal rank
@@ Property / cites work @@
+Q4501548
@@ Property / cites work: Q4501548 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503938
@@ Property / cites work: Q4503938 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4736842
@@ Property / cites work: Q4736842 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252299
@@ Property / cites work: Q4252299 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027320
@@ Property / cites work: Q4027320 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4780785
@@ Property / cites work: Q4780785 / rank @@
+Normal rank
@@ Property / cites work @@
+A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
+Normal rank
@@ Property / cites work @@
+On the relationship between the biconnectivity augmentation and traveling salesman problems
+Normal rank
@@ Property / cites work @@
+Q4474101
@@ Property / cites work: Q4474101 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for 2-edge-connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4845372
@@ Property / cites work: Q4845372 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Graph Augmentation
@@ Property / cites work: Approximation Algorithms for Graph Augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+Biconnectivity approximations and graph carvings
@@ Property / cites work: Biconnectivity approximations and graph carvings / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762522
@@ Property / cites work: Q2762522 / rank @@
+Normal rank
@@ Property / cites work @@
+A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities
+Normal rank
@@ Property / cites work @@
+An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
+Normal rank
@@ Property / cites work @@
+NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems
+Normal rank
@@ Property / cites work @@
+Q2753746
@@ Property / cites work: Q2753746 / rank @@
+Normal rank