✦ LIBER ✦

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

✍ Scribed by Horst Hamacher

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 205 KB
Volume: 1
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(82)90037-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finding the K best cuts in a network

✍ Horst W. Hamacher; Jean-Claude Picard; Maurice Queyranne 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 145 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

An algorithm for determining the best pa

An algorithm for determining the best path in a computer communication network

✍ V.K. Jain; Krishna Gopal 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 243 KB

An Algorithm for finding the optimal pat

An Algorithm for finding the optimal path on a network with bans

✍ V.F. Krivorotov 📂 Article 📅 1975 🏛 Elsevier Science ⚖ 648 KB

An O(n log n) algorithm for finding all

An O(n log n) algorithm for finding all repetitions in a string

✍ Michael G Main; Richard J Lorentz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 602 KB

An O (k · n)-time algorithm for computin

An O (k · n)-time algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system: F. K. Hwang. IEEE Transactions on Reliability, 42(1), 161 (1993)

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 105 KB