✦ LIBER ✦

Towards an asymptotic analysis of Karmarkar's algorithm

✍ Scribed by Lenore Blum

Book ID: 113162959
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 323 KB
Volume: 23
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90134-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of the Karmarkar-Karp differenc

Analysis of the Karmarkar-Karp differencing algorithm

✍ S. Boettcher; S. Mertens 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 366 KB

An extension of Karmarkar's projective a

An extension of Karmarkar's projective algorithm for convex quadratic programming

✍ Yinyu Ye; Edison Tse 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 884 KB

Asymptotic behaviour of Karmarkar's meth

Asymptotic behaviour of Karmarkar's method for linear programming

✍ Miroslav D. Asic; Vera V. Kovacevic-Vujcic; Mirjana D. Radosavljevic-Nikolic 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 638 KB

A modification of karmarkar's linear pro

A modification of karmarkar's linear programming algorithm

✍ Robert J. Vanderbei; Marc S. Meketon; Barry A. Freedman 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 563 KB

A Self-Correcting Version of Karmarkar’s

A Self-Correcting Version of Karmarkar’s Algorithm

✍ Goldfarb, Donald; Mehrotra, Sanjay 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 948 KB

Asymptotic analysis of an optimized quic

Asymptotic analysis of an optimized quicksort algorithm

✍ Marianne Durand 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Jon Bentley and Douglas McIlroy have implemented a fast quicksort for the C standard library in 1993. We consider here the average-case complexity in terms of number of comparisons of this algorithm, and give its asymptotic expansion up to the constant order.