𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A 2.5 times optimal algorithm for packing in two dimensions

✍ Scribed by Daniel D.K.D.B. Sleator

Book ID
113162246
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
558 KB
Volume
10
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Linear-Time Deterministic Algorithms
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
✍ Bernard Chazelle; Jiřı́ MatouΕ‘ek πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 208 KB

We show that with recently developed derandomization techniques, one can convert Clarkson's randomized algorithm for linear programming in fixed dimension into a linear-time deterministic algorithm. The constant of proportionality is d O Ε½ d . , which is better than those for previously known algori