✦ LIBER ✦

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

✍ Scribed by Omer Angel, Abraham D. Flaxman, David B. Wilson

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Network flow models for designing diamet

✍ Luis Gouveia; Thomas L. Magnanti 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

A 2-path approach for odd-diameter-const

✍ Luis Gouveia; Thomas L. Magnanti; Cristina Requejo 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

A Matter of Degree: Improved Approximati

✍ Könemann, J.; Ravi, R. 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 155 KB

Sharp threshold for the appearance of ce

✍ Hefetz, Dan; Krivelevich, Michael; Szabó, Tibor 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 302 KB

A branch and bound algorithm for the cap

✍ Kavindra Malik; Gang Yu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

Algorithms for finding and updating mini

✍ Pranay Chaudhuri; Asad A. Ismaeel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 564 KB