Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut
S. Gharibian, O. Parekh, in: Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2019, p. 31:1-31:17.
Download (ext.)
Conference Paper
| Published
| English
Author
Gharibian, SevagLibreCat 
;
Parekh, Ojas
;
Parekh, OjasPublishing Year
Proceedings Title
Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)
forms.conference.field.series_title_volume.label
Leibniz International Proceedings in Informatics (LIPIcs)
Volume
145
Page
31:1-31:17
LibreCat-ID
Cite this
Gharibian S, Parekh O. Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. In: Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). Vol 145. Leibniz International Proceedings in Informatics (LIPIcs). ; 2019:31:1-31:17. doi:10.4230/LIPICS.APPROX-RANDOM.2019.31
Gharibian, S., & Parekh, O. (2019). Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 145, 31:1-31:17. https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31
@inproceedings{Gharibian_Parekh_2019, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut}, volume={145}, DOI={10.4230/LIPICS.APPROX-RANDOM.2019.31}, booktitle={Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)}, author={Gharibian, Sevag and Parekh, Ojas}, year={2019}, pages={31:1-31:17}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }
Gharibian, Sevag, and Ojas Parekh. “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.” In Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 145:31:1-31:17. Leibniz International Proceedings in Informatics (LIPIcs), 2019. https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31.
S. Gharibian and O. Parekh, “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut,” in Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2019, vol. 145, p. 31:1-31:17, doi: 10.4230/LIPICS.APPROX-RANDOM.2019.31.
Gharibian, Sevag, and Ojas Parekh. “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.” Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), vol. 145, 2019, p. 31:1-31:17, doi:10.4230/LIPICS.APPROX-RANDOM.2019.31.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Closed Access
Google Scholar