A note on the $k$-minimum spanning tree problem on circles

DOI10.1016/J.ORL.2015.12.019zbMath1408.90298OpenAlexW2225736651MaRDI QIDQ1785744

Dieter Jungnickel, Thomas Knecht

Publication date: 1 October 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.12.019

zbMATH Keywords

dynamic programmingshortest path problem$k$-minimum spanning tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Weighted k‐cardinality trees: Complexity and polyhedral structure
• Spanning Trees—Short or Small

This page was built for publication: A note on the $k$-minimum spanning tree problem on circles