Peng Zhang, Chenchen wu, Dachuan Xu, Xinghe Zhang. Approximation and Hardness Results for the Max k-Uncut Problem. In T.-H. Hubert Chan, Minming Li, Lusheng Wang, editors, Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings. Volume 10043 of Lecture Notes in Computer Science, pages 49-61, Springer, 2016. [doi]
@inproceedings{ZhangWXZ16-0,
title = {Approximation and Hardness Results for the Max k-Uncut Problem},
author = {Peng Zhang and Chenchen wu and Dachuan Xu and Xinghe Zhang},
year = {2016},
doi = {10.1007/978-3-319-48749-6_4},
url = {http://dx.doi.org/10.1007/978-3-319-48749-6_4},
researchr = {https://researchr.org/publication/ZhangWXZ16-0},
cites = {0},
citedby = {0},
pages = {49-61},
booktitle = {Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings},
editor = {T.-H. Hubert Chan and Minming Li and Lusheng Wang},
volume = {10043},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-48748-9},
}