Exact algorithms for finding constrained minimum spanning trees (Q2082219): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-020-00579-z
+Normal rank
@@ Property / OpenAlex ID @@
+W3023896539
@@ Property / OpenAlex ID: W3023896539 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
+Normal rank
@@ Property / cites work @@
+The 2-hop spanning tree problem
@@ Property / cites work: The 2-hop spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Polynomial Time Approximation Scheme for the Constrained  Minimum Spanning Tree Problem Using Matroid Intersection
+Normal rank
@@ Property / cites work @@
+A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Bicriteria Network Design Problems
@@ Property / cites work: Bicriteria Network Design Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The constrained minimum spanning tree problem
@@ Property / cites work: The constrained minimum spanning tree problem / rank @@
+Normal rank