✦ LIBER ✦

A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology

✍ Scribed by Guoliang Xue; Wei Xiao

Book ID: 106148570
Publisher: Springer
Year: 2004
Tongue: English
Weight: 727 KB
Volume: 41
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-004-1119-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Polynomial-Time Approximation Scheme f

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

✍ Wu, Bang Ye; Lancia, Giuseppe; Bafna, Vineet; Chao, Kun-Mao; Ravi, R.; Tang, Chu 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 409 KB

A Polynomial Time Approximation Scheme f

A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem

✍ Joonmo Kim; Mihaela Cardei; Ionut Cardei; Xiaohua Jia 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 230 KB

A Polynomial Time Approximation Scheme f

A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application

✍ Jiang, Tao; Kearney, Paul; Li, Ming 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 226 KB