The hybrid spanning tree problem

DOI10.1016/0377-2217(94)90037-XzbMATH Open0810.90125MaRDI QIDQ1333484FDOQ1333484

Authors: V. Pereyra 

Publication date: 15 September 1994

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

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

zbMATH Keywords

computational analysisminimal spanning treehybrid spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

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

Cited In (4)

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

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)