✦ LIBER ✦

A fast algorithm for multiplying min-sum permutations

✍ Scribed by Yoshifumi Sakai

Book ID: 113564632
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 316 KB
Volume: 159
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.06.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast permutation-based algorithm for b

A fast permutation-based algorithm for block clustering

✍ I. Llatas; A. J. Quiroz; J. M. Renóm 📂 Article 📅 1997 🏛 CrossRef test prefix 🌐 English ⚖ 947 KB

A fast hypergraph min-cut algorithm for

A fast hypergraph min-cut algorithm for circuit partitioning

✍ Wai-Kei Mak; D.F. Wong 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Circuit partitioning is one of the central problems in VLSI system design. The primary objective of circuit partitioning is to minimize the number of interconnections between di!erent components of the partitioned circuit. So the circuit partitioning problem is closely related to the minimum cut pro

A Fast Approximation Algorithm for the S

A Fast Approximation Algorithm for the Subset-sum Problem

✍ Bartosz Przydatek 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 746 KB

A Simple and Fast Min-Cut Algorithm

✍ Michael Brinkmeier 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 488 KB

A second improved digit-reversal permuta

A second improved digit-reversal permutation algorithm for fast transforms

✍ Evans, D.M.W. 📂 Article 📅 1989 🏛 IEEE ⚖ 380 KB

A min-sum 3/2-approximation algorithm fo

A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines

✍ Fabián A. Chudak 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 70 KB 👁 1 views

We consider the problem of minimizing the sum of weighted completion times of jobs scheduled on unrelated parallel machines. That is, there are n jobs and m machines; job j takes p GH units of time if processed on machine i and has a weight w H . If C H is the completion time of job j, the objective