Algorithms for solving the k-star hub problem for trees and series-parallel graphs

MaRDI QIDQ3450144zbMATHFDO

Authors V. V. Lepin

Publication date 2 November 2015

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Approximation algorithms for the star \(k\)-hub center problem in metric graphs
• Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs
• Optimum Communication Spanning Trees in Series-Parallel Networks
• An \(O(Kn \log (Kn))\) algorithm for the \(K\)th best spanning tree in series parallel graphs
• Weighted k‐cardinality trees: Complexity and polyhedral structure

Cited in

(3)

• Steiner diagrams and \(k\)-star hubs
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
• The complete optimal stars-clustering-tree problem

This page was built for publication: Algorithms for solving the \(k\)-star hub problem for trees and series-parallel graphs

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