Bounded-degree spanning tree problems: models and new algorithms
From MaRDI portal
Publication:632386
DOI10.1007/S10589-007-9120-2zbMATH Open1211.90259OpenAlexW2096938240MaRDI QIDQ632386FDOQ632386
Authors: A. Iossa, Raffaele Cerulli, Monica Gentili 
Publication date: 24 March 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9120-2
Recommendations
- scientific article; zbMATH DE number 2086635
- Spanning Trees with Few Branch Vertices
- A generalization of the minimum branch vertices spanning tree problem
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Spanning trees with many or few colors in edge-colored graphs
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
- ILP formulation of the degree-constrained minimum spanning hierarchy problem
- Approximating spanning trees with few branches
- An exact and heuristic approach for the \(d\)-minimum branch vertices problem
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem
- Title not available (Why is that?)
- Spanning Trees with Few Branch Vertices
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- A generalization of the minimum branch vertices spanning tree problem
- Lower and upper bounds for the spanning tree with minimum branch vertices
- Near-optimal bounded-degree spanning trees
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Lower bound for the cost of connecting tree with given vertex degree sequence
- New branch-and-bound algorithms for \(k\)-cardinality tree problems
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
- Relations, models and a memetic approach for three degree-dependent spanning tree problems
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- Approximating spanning trees with few branches
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems
Uses Software
This page was built for publication: Bounded-degree spanning tree problems: models and new algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632386)
