Nikolaos Melissinos, Aris Pagourtzis. A Faster FPTAS for the Subset-Sums Ratio Problem. 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 602-614, Springer, 2018. [doi]
@inproceedings{MelissinosP18,
title = {A Faster FPTAS for the Subset-Sums Ratio Problem},
author = {Nikolaos Melissinos and Aris Pagourtzis},
year = {2018},
doi = {10.1007/978-3-319-94776-1_50},
url = {https://doi.org/10.1007/978-3-319-94776-1_50},
researchr = {https://researchr.org/publication/MelissinosP18},
cites = {0},
citedby = {0},
pages = {602-614},
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},
}