✦ LIBER ✦

Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees

✍ Scribed by J. H. Rubinstein; J. Weng; N. Wormald

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 187 KB
Volume: 35
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-005-4207-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for the relative greedy alg

Lower bounds for the relative greedy algorithm for approximating Steiner trees

✍ Stefan Hougardy; Stefan Kirchner 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

The class Steiner minimal tree problem:

The class Steiner minimal tree problem: a lower bound and test problem generation

✍ Boting Yang; Paul Gillard 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 131 KB

Lower bounds for the length of test sequ

Lower bounds for the length of test sequences using UIOs

✍ Marion Rodrigues; Hasan Ural 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 829 KB

Upper and lower bounds for the lengths o

Upper and lower bounds for the lengths of non-propagating cracks

✍ A.D. Cameron; R.A. Smith 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Upper and lower bounds for the rate cons

Upper and lower bounds for the rate constant of bimolecular reactions: integral approximation method

✍ A.A. Zharikov; N.V. Shokhirev 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 297 KB

A method for the calculation of rate constants of bimolecular reactions for an arbitrary type of spherically isotropic transfer probabilities and the interaction potentials between reagents has been developed. On the basis of this method, an integral representation of upper and lower bounds for quen

Upper and Lower Bounds on the Makespan o

Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays

✍ K. Kalpakis; Y. Yesha 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 322 KB