Pages that link to "Item:Q4474303"

The following pages link to The maximum-leaf spanning tree problem: Formulations and facets (Q4474303):

Displaying 24 items.

• Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
• Flow-based formulation for the maximum leaf spanning tree problem (Q324785) (← links)
• A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
• Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← links)
• Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
• An exact algorithm for the maximum leaf spanning tree problem. (Q1413822) (← links)
• The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
• Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) (← links)
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem (Q2289917) (← links)
• On connected dominating sets of restricted diameter (Q2356248) (← links)
• On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
• (Q2992654) (← links)
• The regenerator location problem (Q3057148) (← links)
• Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
• (Q3581682) (← links)
• Complexity of spanning tree problems with leaf-dependent objectives (Q4887748) (← links)
• A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
• The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
• Spanning Trees with Many Leaves in Regular Bipartite Graphs (Q5387825) (← links)
• Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights (Q5900911) (← links)
• Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)