✦ LIBER ✦

A Lower Bound for Heilbronn'S Problem

✍ Scribed by Komlos, J.; Pintz, J.; Szemeredi, E.

Book ID: 120095144
Publisher: Oxford University Press
Year: 1982
Tongue: English
Weight: 226 KB
Volume: s2-25
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-25.1.13

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound for Heilbronn's Triangle P

A Lower Bound for Heilbronn's Triangle Problem in d Dimensions

✍ Barequet, Gill 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 143 KB

Lower bounds for Turán's problem

✍ Peter Frankl; Vojtěch Rödl 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 138 KB

A lower bound on solutions of Chartrand'

A lower bound on solutions of Chartrand's problem

✍ Liu Guizhen 📂 Article 📅 1984 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 252 KB

A lower bound for the job insertion prob

A lower bound for the job insertion problem

✍ Tamás Kis; Alain Hertz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 490 KB

This note deals with the job insertion problem in job-shop scheduling: Given a feasible schedule of n jobs and a new job which is not scheduled, the problem is to ÿnd a feasible insertion of the new job into the schedule which minimises the makespan. Since the problem is NP-hard, a relaxation method

A general lower bound for the makespan p

A general lower bound for the makespan problem

✍ S.T. Webster 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 598 KB

A Lower Bound for the Shortest Path Prob

A Lower Bound for the Shortest Path Problem

✍ Ketan Mulmuley; Pradyut Shah 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 183 KB