{"status":"public","author":[{"orcid":"0000-0002-9992-3379","full_name":"Gharibian, Sevag","id":"71541","first_name":"Sevag","last_name":"Gharibian"},{"full_name":"Parekh, Ojas","first_name":"Ojas","last_name":"Parekh"}],"intvolume":"       145","page":"31:1-31:17","type":"conference","user_id":"71541","title":"Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut","date_updated":"2023-02-28T11:05:46Z","language":[{"iso":"eng"}],"citation":{"mla":"Gharibian, Sevag, and Ojas Parekh. “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.” <i>Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, vol. 145, 2019, p. 31:1-31:17, doi:<a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">10.4230/LIPICS.APPROX-RANDOM.2019.31</a>.","chicago":"Gharibian, Sevag, and Ojas Parekh. “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.” In <i>Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 145:31:1-31:17. Leibniz International Proceedings in Informatics (LIPIcs), 2019. <a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31</a>.","short":"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.","ieee":"S. Gharibian and O. Parekh, “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut,” in <i>Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 2019, vol. 145, p. 31:1-31:17, doi: <a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">10.4230/LIPICS.APPROX-RANDOM.2019.31</a>.","apa":"Gharibian, S., &#38; Parekh, O. (2019). Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. <i>Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, <i>145</i>, 31:1-31:17. <a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31</a>","ama":"Gharibian S, Parekh O. Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. In: <i>Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>. Vol 145. Leibniz International Proceedings in Informatics (LIPIcs). ; 2019:31:1-31:17. doi:<a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">10.4230/LIPICS.APPROX-RANDOM.2019.31</a>","bibtex":"@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={<a href=\"https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31\">10.4230/LIPICS.APPROX-RANDOM.2019.31</a>}, 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)} }"},"year":"2019","_id":"13297","publication":"Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)","date_created":"2019-09-19T08:33:29Z","department":[{"_id":"623"},{"_id":"7"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":"10.4230/LIPICS.APPROX-RANDOM.2019.31","oa":"1","publication_status":"published","volume":145,"main_file_link":[{"open_access":"1","url":"http://drops.dagstuhl.de/opus/volltexte/2019/11246/"}]}