✦ LIBER ✦

An improved algorithm for the k-source maximum eccentricity spanning trees

✍ Scribed by Bang Ye Wu

Book ID: 108110495
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 236 KB
Volume: 143
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.12.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multi-source spanning trees: algorithms

Multi-source spanning trees: algorithms for minimizing source eccentricities

✍ H.Brendan McMahan; Andrzej Proskurowski 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 212 KB

We present two e cient algorithms constructing a spanning tree with minimum eccentricity of a source, for a given graph with weighted edges and a set of source vertices. The ÿrst algorithm is both simpler to implement and faster of the two. The second approach involves enumerating single-source shor

An Algorithm for Finding K Minimum Spann

An Algorithm for Finding K Minimum Spanning Trees

✍ Katoh, N.; Ibaraki, T.; Mine, H. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 964 KB

An exact algorithm for the Maximum Leaf

An exact algorithm for the Maximum Leaf Spanning Tree problem

✍ Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedlof 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 313 KB

Approximation algorithms for some k-sour

Approximation algorithms for some k-source shortest paths spanning tree problems

✍ Yen Hung Chen; Bang Ye Wu; Chuan Yi Tang 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

An exact exponential-time algorithm for

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem

✍ Binkele-Raible, Daniel; Fernau, Henning 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Reformulations and solution algorithms f

Reformulations and solution algorithms for the maximum leaf spanning tree problem

✍ Abilio Lucena; Nelson Maculan; Luidi Simonetti 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 315 KB