A randomly weighted minimum spanning tree with a random cost constraint

DOI10.1137/1.9781611975994.41MaRDI QIDQ5146809zbMATH OpenOpenAlexFDO

Authors Tomasz Tkocz, Alan Frieze

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975994.41

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Random-tree diameter and the diameter-constrained MST
• Random-tree Diameter and the Diameter-constrained MST
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• A randomly weighted minimum arborescence with a random cost constraint
• On finding a minimum spanning tree in a network with random weights

This page was built for publication: A randomly weighted minimum spanning tree with a random cost constraint

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