{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T11:32:21Z","timestamp":1769859141628,"version":"3.49.0"},"reference-count":40,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/isspit.2016.7886013","type":"proceedings-article","created":{"date-parts":[[2017,3,28]],"date-time":"2017-03-28T02:53:28Z","timestamp":1490669608000},"page":"81-86","source":"Crossref","is-referenced-by-count":10,"title":["On k-subset sum using enumerative encoding"],"prefix":"10.1109","author":[{"given":"Victor","family":"Parque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Miyashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368162"},{"key":"ref38","article-title":"The Art of Computing Programming","volume":"2","author":"knuth","year":"1968","journal-title":"Seminu-merical Algorithms"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/355934.355937"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/355609.362322"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362502"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/366274.366309"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90226-7"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/44.4.292"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.11.048"},{"key":"ref34","first-page":"326340","volume":"3059","author":"martinez","year":"2004","journal-title":"Experimental and EffiCient Algorithms Lecture Notes in Computer Science"},{"key":"ref10","article-title":"Why is combinatorial communication rare in the natural world, and why is language an exception to this trend?","volume":"10","year":"2013","journal-title":"Journal of The Royal Society Interface"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.2009457"},{"key":"ref11","article-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"martello","year":"1990","journal-title":"UK"},{"key":"ref12","article-title":"Computers and Intractability: A guide to the Theory of NP-completeness","author":"garey","year":"1979"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.53763"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.70"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.23.6.1099"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.1.332"},{"key":"ref17","author":"pisinger","year":"1995","journal-title":"An O(nr) algorithm for the subset-sum problem"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00329-5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00157-5"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.06.051"},{"key":"ref4","first-page":"325338","article-title":"Enumerating spanning and connected subsets in graphs and matroids","volume":"50","author":"khachiyan","year":"2007","journal-title":"J Oper Res Soc Jpn"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.07.003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.02.008"},{"key":"ref6","first-page":"307328","article-title":"Fast discovery of association rules","author":"agrawal","year":"1996","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"ref29","first-page":"5","article-title":"Generating All Combinations and Partitions","author":"knuth","year":"0","journal-title":"The Art of Computer Programming Ser Fascicle 3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36504-4_4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1021\/ci200084b"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11998-007-9000-9"},{"key":"ref2","first-page":"2437","article-title":"Parallel Algorithm for Learning Optimal Bayesian Network Structure","volume":"12","author":"tamada","year":"2011","journal-title":"The Journal of Machine Learning Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284323"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2007.903229"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICIE.2009.15"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00046-X"},{"key":"ref21","first-page":"618621","article-title":"An implementation of spacetime tradeoff method for subset sum problem","author":"mine","year":"2011","journal-title":"5'th International Conference on Computer Sciences and Convergence Information Technology (ICCIT)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2003.12.003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321823"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.12.063"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542401"}],"event":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","location":"Limassol, Cyprus","start":{"date-parts":[[2016,12,12]]},"end":{"date-parts":[[2016,12,14]]}},"container-title":["2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7879518\/7885993\/07886013.pdf?arnumber=7886013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,18]],"date-time":"2017-04-18T10:47:59Z","timestamp":1492512479000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7886013\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/isspit.2016.7886013","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}