Approximating Subset Sum Ratio via Subset Sum Computations-Reference-Cited by-同舟云学术

Approximating Subset Sum Ratio via Subset Sum Computations

Published:2022 Issue: Volume: Page:73-85
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Alonistiotis Giannis^ORCID,Antonopoulos Antonis^ORCID,Melissinos Nikolaos^ORCID,Pagourtzis Aris^ORCID,Petsalakis Stavros^ORCID,Vasilakis Manolis^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-06678-8_6

Reference31 articles.

1. Abboud, A., Bringmann, K., Hermelin, D., Shabtay, D.: Seth-based lower bounds for subset sum and bicriteria path. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, 6–9 January 2019, pp. 41–57. SIAM (2019). https://doi.org/10.1137/1.9781611975482.3

2. Antonopoulos, A., Pagourtzis, A., Petsalakis, S., Vasilakis, M.: Faster algorithms for $$k$$-subset sum and variations. In: J., Chen, Li, M., Zhang, G. (eds.): Frontiers of Algorithmics - International Joint Conference, IJTCS-FAW 2021, Beijing, 16–19 August 2021, Proceedings. LNCS, vol. 12874, pp. 37–52. Springer (2021). https://doi.org/10.1007/978-3-030-97099-4_3

3. Austrin, P., Kaski, P., Koivisto, M., Nederlof, J.: Subset sum in the absence of concentration. In: 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, 4–7 March 2015, Garching. LIPIcs, vol. 30, pp. 48–61. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015). https://doi.org/10.4230/LIPIcs.STACS.2015.48

4. Austrin, P., Kaski, P., Koivisto, M., Nederlof, J.: Dense subset sum may be the hardest. In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, 17–20 February 2016. https://doi.org/10.4230/LIPIcs.STACS.2016.13

5. Bazgan, C., Santha, M., Tuza, Z.: Efficient approximation algorithms for the SUBSET-SUMS EQUALITY problem. J. Comput. Syst. Sci. 64(2), 160–170 (2002). https://doi.org/10.1006/jcss.2001.1784

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximating subset sum ratio via partition computations;Acta Informatica;2024-01-12

2. Faster algorithms for k-subset sum and variations;Journal of Combinatorial Optimization;2022-12-01