On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(82)90059-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2038858023
@@ Property / OpenAlex ID: W2038858023 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Treatment of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Finding Minimum Spanning Trees
@@ Property / cites work: Finding Minimum Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4744064
@@ Property / cites work: Q4744064 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+Q4161330
@@ Property / cites work: Q4161330 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Priority queues with update and finding minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Smallest Augmentations to Biconnect a Graph
@@ Property / cites work: Smallest Augmentations to Biconnect a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
+Normal rank