✦ LIBER ✦

Average and worst-case performance of Paull’s algorithms for rearranging threestage connection networks

✍ Scribed by Marek Kubale

Book ID: 112971255
Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 558 KB
Volume: 40
Category: Article
ISSN: 0003-4347
DOI: 10.1007/bf03004502

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case performance of approximation

Worst-case performance of approximation algorithms for tool management problems

✍ Yves Crama; Joris van de Klundert 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 2 views

Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems. Several of these problems are not encountered in more classical production settings, and so-called tool management problems appear to b

Elimination of Infrequent Variables Impr

Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms

✍ Franco, John 📂 Article 📅 1991 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 900 KB

On the worst-case performance of some al

On the worst-case performance of some algorithms for the asymmetric traveling salesman problem

✍ A. M. Frieze; G. Galbiati; F. Maffioli 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 657 KB