Spanning trees with variable degree bounds

DOI10.1016/J.EJOR.2014.05.034zbMath1339.90087OpenAlexW2017744263MaRDI QIDQ297415

F. Blanchet-Sadri, M. Dambrine

Publication date: 27 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.05.034

zbMATH Keywords

spanning treewireless mesh networksdegree constraintsOR in telecommunications networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prize collecting Steiner trees with node degree dependent costs
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• A branch and cut method for the degree-constrained minimum spanning tree problem
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• Lower and upper bounds for the degree-constrained minimum spanning tree problem
• Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs

This page was built for publication: Spanning trees with variable degree bounds