✦ LIBER ✦

New lower and upper bounds for on-line scheduling

✍ Scribed by Bo Chen; André van Vliet; Gerhard J. Woeginger

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 507 KB
Volume: 16
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(94)90071-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Upper and Lower Bounds for Ramsey Nu

New Upper and Lower Bounds for Ramsey Numbers

✍ Huang Yi Ru; Yang Jian Sheng 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 76 KB

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.

Upper and lower bounds for eigenvalues

✍ Walter Leighton 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Upper and lower bounds for expectation v

Upper and lower bounds for expectation values

✍ P.S.C. Wang 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Lower bounds for on-line graph coloring

✍ Magnus M. Halldórsson; Mario Szegedy 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 771 KB

Lower bounds for single-machine scheduli

Lower bounds for single-machine scheduling problems

✍ Reza H. Ahmadi; Uttarayan Bagchi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 588 KB