✦ LIBER ✦

Finding minimum cost directed trees with demands and capacities

✍ Scribed by Choaib Bousba; Laurence A. Wolsey

Book ID: 112688029
Publisher: Springer US
Year: 1991
Tongue: English
Weight: 817 KB
Volume: 33
Category: Article
ISSN: 0254-5330
DOI: 10.1007/bf02071977

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum Cost Partitions of Trees with Su

Minimum Cost Partitions of Trees with Supply and Demand

✍ Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 666 KB

A Note on Finding Minimum-Cost Edge-Disj

A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees

✍ James Roskind and Robert E. Tarjan 📂 Article 📅 1985 🏛 INFORMS 🌐 English ⚖ 369 KB

Efficient algorithms for finding minimum

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

✍ Harold N. Gabow; Zvi Galil; Thomas Spencer; Robert E. Tarjan 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 939 KB

Priority queues with update and finding

Priority queues with update and finding minimum spanning trees

✍ Donald B. Johnson 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 751 KB

A new heuristic algorithm for finding mi

A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay

✍ Anna Hać; Kelei Zhou 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

## This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree; (3) dyn

Cost recovery from congestion tolls with

Cost recovery from congestion tolls with random capacity and demand

✍ Robin Lindsey 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 345 KB