T.-H. Hubert Chan, Bintao Sun. SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. In Lusheng Wang, Daming Zhu, editors, Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings. Volume 10976 of Lecture Notes in Computer Science, pages 688-700, Springer, 2018. [doi]
@inproceedings{ChanS18-0,
title = {SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands},
author = {T.-H. Hubert Chan and Bintao Sun},
year = {2018},
doi = {10.1007/978-3-319-94776-1_57},
url = {https://doi.org/10.1007/978-3-319-94776-1_57},
researchr = {https://researchr.org/publication/ChanS18-0},
cites = {0},
citedby = {0},
pages = {688-700},
booktitle = {Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings},
editor = {Lusheng Wang and Daming Zhu},
volume = {10976},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-94776-1},
}