✦ LIBER ✦

The realization problem for Euclidean minimum spanning trees is NP-hard

✍ Scribed by P. Eades and S. Whitesides

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Np-hardness proof and an approximation a

✍ Keizo Miyata; Shigeru Masuyama; Shin-ichi Nakayama; Liang Zhao 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 309 KB

The minimum-length generator sequence pr

✍ S Even; O Goldreich 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Rate of convergence for the Euclidean mi

✍ Patrick Jaillet 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 353 KB

RAMP for the capacitated minimum spannin

✍ Cesar Rego; Frank Mathew; Fred Glover 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 419 KB

Note Computing the nucleolus of min-cost

✍ Ulrich Faigle; Walter Kern; Jeroen Kuipers 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 153 KB

Relaxation methods for the Generalized M

✍ P.C. Pop; W. Kern; G. Still; U. Faigle 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 185 KB