✦ LIBER ✦

An O(nlog2n) algorithm for the maximum weigthed tardiness problem

✍ Scribed by Dorit S. Hochbaum; Ron Shamir

Book ID: 113163419
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 728 KB
Volume: 31
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90126-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A faster algorithm for the maximum weigh

A faster algorithm for the maximum weighted tardiness problem

✍ Malcolm C. Fields; Greg N. Frederickson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 503 KB

An O(nlog log n) Learning Algorithm for

An O(nlog log n) Learning Algorithm for DNF under the Uniform Distribution

✍ Y. Mansour 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 571 KB

We show that a DNF with terms of size at most \(d\) can be approximated by a function at most \(d^{O(d \log 1 / \epsilon)}\) nonzero Fourier coefficients such that the expected error squared, with respect to the uniform distribution, is at most \(\epsilon\). This property is used to derive a learnin

An O ( n log n ) Algorithm for the Maxim

An O ( n log n ) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

✍ Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thor 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 238 KB

An O(20.304n) Algorithm for Solving Maxi

An O(20.304n) Algorithm for Solving Maximum Independent Set Problem

✍ Tang Jian 📂 Article 📅 1986 🏛 IEEE 🌐 English ⚖ 796 KB

An efficient algorithm for the single ma

An efficient algorithm for the single machine tardiness problem

✍ Suna Kondakci; Ömer Kirca; Meral Azizoǧlu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 553 KB

An O(n2) algorithm for the maximum cycle

An O(n2) algorithm for the maximum cycle mean of an n×n bivalent matrix

✍ P. Butkovic; R.A. Cuninghame-Green 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 503 KB