The hybrid spanning tree problem

DOI10.1016/0377-2217(94)90037-XzbMath0810.90125MaRDI QIDQ1333484

V. Pereyra

Publication date: 15 September 1994

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

zbMATH Keywords

minimal spanning treecomputational analysishybrid spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Multiobjective routing problems

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
• The probabilistic minimum spanning tree problem
• Stochastic bottleneck spanning tree problem
• Efficient Planarity Testing
• Minimal ratio spanning trees
• A good algorithm for smallest spanning trees with a degree constraint
• An improved equivalence algorithm

This page was built for publication: The hybrid spanning tree problem