Approximating Knapsack and Partition via Dense Subset Sums

Mingyang Deng, Ce Jin, Xiao Mao. Approximating Knapsack and Partition via Dense Subset Sums. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 2961-2979, SIAM, 2023. [doi]

@inproceedings{DengJM23,
  title = {Approximating Knapsack and Partition via Dense Subset Sums},
  author = {Mingyang Deng and Ce Jin and Xiao Mao},
  year = {2023},
  doi = {10.1137/1.9781611977554.ch113},
  url = {https://doi.org/10.1137/1.9781611977554.ch113},
  researchr = {https://researchr.org/publication/DengJM23},
  cites = {0},
  citedby = {0},
  pages = {2961-2979},
  booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023},
  editor = {Nikhil Bansal 0001 and Viswanath Nagarajan},
  publisher = {SIAM},
  isbn = {978-1-61197-755-4},
}