Hoang Chi Thanh, Nguyen Quang Thanh. An Efficient Parallel Algorithm for the Set Partition Problem. In Ngoc Thanh Nguyen, Bogdan Trawinski, Jason J. Jung, editors, New Challenges for Intelligent Information and Database Systems [original works presented during a poster session organized within the 3rd Asian Conference on Intelligent Information and Database Systems, 20-22 April 2011, Daegu, Korea]. Volume 351 of Studies in Computational Intelligence, pages 25-32, Springer, 2011. [doi]
@inproceedings{ThanhT11,
title = {An Efficient Parallel Algorithm for the Set Partition Problem},
author = {Hoang Chi Thanh and Nguyen Quang Thanh},
year = {2011},
doi = {10.1007/978-3-642-19953-0_3},
url = {http://dx.doi.org/10.1007/978-3-642-19953-0_3},
tags = {partitioning},
researchr = {https://researchr.org/publication/ThanhT11},
cites = {0},
citedby = {0},
pages = {25-32},
booktitle = {New Challenges for Intelligent Information and Database Systems [original works presented during a poster session organized within the 3rd Asian Conference on Intelligent Information and Database Systems, 20-22 April 2011, Daegu, Korea]},
editor = {Ngoc Thanh Nguyen and Bogdan Trawinski and Jason J. Jung},
volume = {351},
series = {Studies in Computational Intelligence},
publisher = {Springer},
isbn = {978-3-642-19952-3},
}