✦ LIBER ✦

Approximation Algorithms for QMA-Complete Problems

✍ Scribed by Gharibian, Sevag; Kempe, Julia

Book ID: 118159090
Publisher: Society for Industrial and Applied Mathematics
Year: 2012
Tongue: English
Weight: 321 KB
Volume: 41
Category: Article
ISSN: 0097-5397
DOI: 10.1137/110842272

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-Complete operations research problems

NP-Complete operations research problems and approximation algorithms

✍ Peter Brucker 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 979 KB

Approximation algorithms for graph appro

Approximation algorithms for graph approximation problems

✍ V. P. Il’ev; S. D. Il’eva; A. A. Navrotskaya 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 579 KB

Approximation Algorithms for Dispersion

Approximation Algorithms for Dispersion Problems

✍ Barun Chandra; Magnús M Halldórsson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Approximation Algorithms for Biclusterin

Approximation Algorithms for Biclustering Problems

✍ Wang, Lusheng; Lin, Yu; Liu, Xiaowen 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 763 KB

Approximation algorithms for geometric m

Approximation algorithms for geometric median problems

✍ Jyh-Han Lin; Jeffrey Scott Vitter 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Approximation Algorithms for Directed St

Approximation Algorithms for Directed Steiner Problems

✍ Moses Charikar; Chandra Chekuri; To-yat Cheung; Zuo Dai; Ashish Goel; Sudipto Gu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 181 KB

We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing.