Flow-based formulation for the maximum leaf spanning tree problem (Q324785): 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.endm.2015.07.035
+Normal rank
@@ Property / OpenAlex ID @@
+W2198010731
@@ Property / OpenAlex ID: W2198010731 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum leaf spanning tree problem.
+Normal rank
@@ Property / cites work @@
+The maximum-leaf spanning tree problem: Formulations and facets
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
+Normal rank
@@ Property / cites work @@
+A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Leaf Spanning Trees in Almost Linear Time
+Normal rank
@@ Property / cites work @@
+Reformulations and solution algorithms for the maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+Improving construction for connected dominating set with Steiner tree in wireless sensor networks
+Normal rank
@@ Property / cites work @@
+Q4252040
@@ Property / cites work: Q4252040 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing full spanning trees for cubic graphs
@@ Property / cites work: Constructing full spanning trees for cubic graphs / rank @@
+Normal rank