Spanning trees with variable degree bounds

DOI10.1016/J.EJOR.2014.05.034MaRDI QIDQ297415zbMATH OpenOpenAlexFDO

Authors Luis Gouveia, Pedro Moura, Mario Ruthmair, A. Sousa

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) Graph algorithms (graph-theoretic aspects) (05C85) Communication networks in operations research (90B18)

Recommendations

• Spanning trees with generalized degree constraints arising in the design of wireless networks
• Spanning trees with node degree cependent costs and knapsack reformulations
• Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
• A multiperiod degree constrained minimal spanning tree problem
• Variable neighborhood search for the degree-constrained minimum spanning tree problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• A branch and cut method for the degree-constrained minimum spanning tree problem
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Lower and upper bounds for the degree-constrained minimum spanning tree problem
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
• Prize collecting Steiner trees with node degree dependent costs
• Spanning trees with node degree cependent costs and knapsack reformulations

Cited in

(4)

• Snarks with special spanning trees
• Node degree distribution in spanning trees
• Spanning trees with node degree cependent costs and knapsack reformulations
• Spanning trees with generalized degree constraints arising in the design of wireless networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297415)