✦ LIBER ✦

Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs

✍ Scribed by Emek, Yuval; Peleg, David

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating minimum-cost graph problem

✍ Michel X. Goemans; David P. Williamson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 435 KB

The minimum spanning tree problem on a p

✍ Tomomi Matsui 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 301 KB

On the Complexity of Approximating Eucli

✍ G. Das; S. Kapoor; M. Smid 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 152 KB

The Stackelberg minimum spanning tree ga

✍ Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 917 KB

A linear-size zero—one programming model

✍ Justin C. Williams 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

An Unconditional Lower Bound on the Time

✍ Elkin, Michael 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 330 KB