What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179): Difference between revisions

@@ Property / cites work @@
+Euclidean bounded-degree spanning tree ratios
@@ Property / cites work: Euclidean bounded-degree spanning tree ratios / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4948506
@@ Property / cites work: Q4948506 / rank @@
+Normal rank
@@ Property / cites work @@
+Network Flow and Testing Graph Connectivity
@@ Property / cites work: Network Flow and Testing Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum-Degree Steiner Tree to within One of Optimal
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+Analysis of Christofides' heuristic: some paths are more difficult than cycles
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Degree-bounded minimum spanning trees
@@ Property / cites work: Degree-bounded minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Low-Degree Spanning Trees of Small Weight
@@ Property / cites work: Low-Degree Spanning Trees of Small Weight / rank @@
+Normal rank
@@ Property / cites work @@
+A matter of degree
@@ Property / cites work: A matter of degree / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual meets local search
@@ Property / cites work: Primal-dual meets local search / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474221
@@ Property / cites work: Q4474221 / rank @@
+Normal rank
@@ Property / cites work @@
+On two geometric problems related to the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
+Normal rank
@@ Property / cites work @@
+Many birds with one stone
@@ Property / cites work: Many birds with one stone / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for degree-constrained minimum-cost network-design problems
+Normal rank
@@ Property / cites work @@
+Approximating minimum bounded degree spanning trees to within one of optimal
+Normal rank