The hybrid spanning tree problem

DOI10.1016/0377-2217(94)90037-XMaRDI QIDQ1333484zbMATH OpenFDO

Authors V. Pereyra

Publication date 15 September 1994

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

zbMATH Keywords

computational analysisminimal spanning treehybrid spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3891405
• The problem of the optimal biobjective spanning tree
• scientific article; zbMATH DE number 35513
• On spanning tree problems with multiple objectives

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A good algorithm for smallest spanning trees with a degree constraint
• An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
• An improved equivalence algorithm
• Efficient Planarity Testing
• Minimal ratio spanning trees
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Stochastic bottleneck spanning tree problem
• The probabilistic minimum spanning tree problem

Cited in

(4)

• Multiobjective routing problems
• The 2-hop spanning tree problem
• Heuristics for the central tree problem
• An algorithm for the minimum spanning tree with a pivotal point in directed networks

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

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