✦ LIBER ✦

On finding the K best cuts in a network

✍ Scribed by Horst W. Hamacher; Jean-Claude Picard; Maurice Queyranne

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 145 KB
Volume: 2
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(84)90083-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(K·n4) algorithm for finding the k b

An O(K·n4) algorithm for finding the k best cuts in a network

✍ Horst Hamacher 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Finding the k quickest simple paths in a

Finding the k quickest simple paths in a network

✍ Y.L. Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 391 KB

Disjoint (s, t)-cuts in a network

✍ Donald K. Wagner 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 638 KB

The k best spanning arborescences of a n

The k best spanning arborescences of a network

✍ P. M. Camerini; L. Fratta; F. Maffioli 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 998 KB

Finding the most vital arcs in a network

✍ Michael O. Ball; Bruce L. Golden; Rakesh V. Vohra 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 256 KB

An Algorithm for Finding the K-Best Allo

An Algorithm for Finding the K-Best Allocations of a Tree Structured Program

✍ A. Billionnet; S. Elloumi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 592 KB

We consider the problem of allocating \(n\) tasks of a distributed program to \(m\) processors of a distributed system in order to minimize total communication and processing costs. If the intertask communication can be represented by a tree and if the communication costs are uniform, it is known th