A generalization of the minimum branch vertices spanning tree problem

DOI10.1007/978-3-319-96151-4_29zbMath1403.90582OpenAlexW2612502174MaRDI QIDQ1661907

Jitamitra Desai, Miklos Molnar, Massinissa Merabet

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96151-4_29

zbMATH Keywords

spanning treeoptical networks\(k\)-MBVSTinteger linear programming (ILP)MBVSTminimization of branch vertices

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth ⋮ An exact and heuristic approach for the \(d\)-minimum branch vertices problem ⋮ The generalized minimum branch vertices problem: properties and polyhedral analysis

This page was built for publication: A generalization of the minimum branch vertices spanning tree problem