✦ LIBER ✦

Worst-case analysis of an algorithm for cellular manufacturing

✍ Scribed by Shu Ming Ng

Book ID: 107992344
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 886 KB
Volume: 69
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)90023-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case analysis of an approximation

Worst-case analysis of an approximation algorithm for flow-shop scheduling

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

An intelligent grouping algorithm for ce

An intelligent grouping algorithm for cellular manufacturing

✍ Kenneth R. Currie 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 352 KB

Worst-case analysis of a scheduling algo

Worst-case analysis of a scheduling algorithm

✍ Jeremy Spinrad 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Worst case analysis of a greedy algorith

Worst case analysis of a greedy algorithm for graph thickness

✍ Sinichiro Kawano; Koichi Yamazaki 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 208 KB

In this paper, we consider a greedy algorithm for thickness of graphs. The greedy algorithm we consider here takes a maximum planar subgraph away from the current graph in each iteration and repeats this process until the current graph has no edge. The greedy algorithm outputs the number of iteratio

Worst case analysis of a graph coloring

Worst case analysis of a graph coloring algorithm

✍ Jeremy P. Spinrad; Gopalakrishnan Vijayan 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Worst-case analysis of a generalized hea

Worst-case analysis of a generalized heapsort algorithm

✍ A. Paulik 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 473 KB