𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximations and Heuristics for the “Cause-Modified” Life Table

✍ Scribed by Kevin P. Brand

Book ID
109157372
Publisher
Springer
Year
2005
Tongue
English
Weight
246 KB
Volume
25
Category
Article
ISSN
1573-9147

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Rajagopalan and Vazirani's 32-approxi
On Rajagopalan and Vazirani's 32-approximation bound for the Iterated 1-Steiner heuristic
✍ Romeo Rizzi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 80 KB

Let G = (V , E) be an undirected graph with costs on the edges specified by w : E → R + . A Steiner tree is any tree of G which spans all nodes in a given subset Rajagopalan and Vazirani [SODA'99, 1999, pp. 742-751] introduced the notion of quasi-bipartiteness and showed that the Iterated 1-Steiner