✦ LIBER ✦

The worst case analysis of algorithm on multiple stacks manipulation

✍ Scribed by Been-Chian Chien; Wei-Pang Yang

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 396 KB
Volume: 44
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90194-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on worst-case analysis of approxi

A note on worst-case analysis of approximation algorithms for a scheduling problem

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 370 KB

A worst-case analysis of two approximate

A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem

✍ Giovanni Righini; Marco Trubian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 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

Worst-case analysis of greedy algorithms

Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems

✍ Tsung-Chyan Lai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Lettereffect of enhanced leaky bucket pa

Lettereffect of enhanced leaky bucket parameters on the maximum queue length: Worst-case analysis

✍ Wu, Jung-Shyr ;Su, Shyh-Wen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 658 KB

In ATM networks, various usage parameter control (UPC) strategies are used to regulate incoming traffic according to the characteristics of the sources declared at call set-up. Among these UPC schemes, the Leaky Bucket method is well-known and has been discussed extensively. In this paper, we study

Worst-case analysis of local search heur

Worst-case analysis of local search heuristics for the one-machine total tardiness problem

✍ Shiwei Chang; Hirofumi Matsuo; Guochun Tang 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB