✦ LIBER ✦

A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms

✍ Scribed by José D.P. Rolim; Luca Trevisan

Book ID: 110281236
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 91 KB
Volume: 2
Category: Article
ISSN: 1382-6905
DOI: 10.1023/a:1009793909670

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case performance of approximation

Worst-case performance of approximation algorithms for tool management problems

✍ Yves Crama; Joris van de Klundert 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 2 views

Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems. Several of these problems are not encountered in more classical production settings, and so-called tool management problems appear to b

A Combinatorial Algorithm Providing Alte

A Combinatorial Algorithm Providing Alternating Approximations for a Zero of an M -Function

✍ Prüefer, Michael 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 965 KB

A combinatorial method for the generatio

A combinatorial method for the generation of normally distributed random numbers

✍ U. Dieter; J. H. Ahrens 📂 Article 📅 1973 🏛 Springer Vienna 🌐 English ⚖ 462 KB

A note on worst-case analysis of approxi

A note on worst-case analysis of approximation algorithms for a scheduling problem

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 370 KB

A case study of memetic algorithms for c

A case study of memetic algorithms for constraint optimization

✍ Ender Özcan; Can Başaran 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 328 KB

A random polynomial-time algorithm for a

A random polynomial-time algorithm for approximating the volume of convex bodies

✍ Dyer, Martin; Frieze, Alan; Kannan, Ravi 📂 Article 📅 1991 🏛 Association for Computing Machinery 🌐 English ⚖ 967 KB