✦ LIBER ✦

Approximating Semidefinite Packing Programs

✍ Scribed by Iyengar, G.; Phillips, D. J.; Stein, C.

Book ID: 118203624
Publisher: Society for Industrial and Applied Mathematics
Year: 2011
Tongue: English
Weight: 453 KB
Volume: 21
Category: Article
ISSN: 1052-6234
DOI: 10.1137/090762671

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating disjoint-path problems usi

Approximating disjoint-path problems using packing integer programs

✍ Stavros G. Kolliopoulos; Clifford Stein 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 247 KB

Convex approximations in stochastic prog

Convex approximations in stochastic programming by semidefinite programming

✍ István Deák, Imre Pólik, András Prékopa, Tamás Terlaky 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 436 KB

Probabilistic construction of determinis

Probabilistic construction of deterministic algorithms: Approximating packing integer programs

✍ Prabhakar Raghavan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 796 KB

Approximate Toeplitz Matrix Problem Usin

Approximate Toeplitz Matrix Problem Using Semidefinite Programming

✍ S. Al-Homidan 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 408 KB

Derandomizing Approximation Algorithms B

Derandomizing Approximation Algorithms Based on Semidefinite Programming

✍ Mahajan, Sanjeev; Ramesh, H. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 482 KB

Approximation Algorithms and Semidefinit

Approximation Algorithms and Semidefinite Programming || Duality and Cone Programming

✍ Gärtner, Bernd; Matousek, Jiri 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 993 KB

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit