{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:32Z","timestamp":1759637672160,"version":"3.40.5"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_36","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"490-505","source":"Crossref","is-referenced-by-count":2,"title":["$$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking"],"prefix":"10.1007","author":[{"given":"Subhashis","family":"Majumder","sequence":"first","affiliation":[]},{"given":"Biswajit","family":"Sanyal","sequence":"additional","affiliation":[]},{"given":"Prosenjit","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Soumik","family":"Sinha","sequence":"additional","affiliation":[]},{"given":"Shiladitya","family":"Pande","sequence":"additional","affiliation":[]},{"given":"Wing-Kai","family":"Hon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Afshani, P., Brodal, G.S., Zeh, N.: Ordered and unordered $$Top$$ - $$k$$ range reporting in large data sets. In: 2011 SODA, pp. 390\u2013400 (2011)","DOI":"10.1137\/1.9781611973082.31"},{"issue":"8","key":"36_CR2","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1109\/TKDE.2004.30","volume":"16","author":"S Chaudhuri","year":"2004","unstructured":"Chaudhuri, S., Gravano, L., Marian, A.: Optimizing $$top$$ - $$k$$ selection queries over multimedia repositories. IEEE Trans. Knowl. Data Eng. 16(8), 992\u20131009 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.tcs.2012.10.052","volume":"470","author":"J Chen","year":"2013","unstructured":"Chen, J., Kanj, I.A., Meng, J., Xia, G., Zhang, F.: Parameterized $$top$$ - $$k$$ algorithms. Theor. Comput. Sci. 470, 105\u2013119 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"36_CR4","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.tcs.2008.06.016","volume":"407","author":"J Chen","year":"2008","unstructured":"Chen, J., Yi, K.: A dynamic data structure for $$top$$ - $$k$$ queries on uncertain data. Theor. Comput. Sci. 407(1\u20133), 310\u2013317 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Karpinski, M., Nekrich, Y.: $$Top$$ - $$k$$ color queries for document retrieval. In: 2011 SODA, pp. 401\u2013411 (2011)","DOI":"10.1137\/1.9781611973082.32"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Lu, J., Senellart, P., Lin, C., Du, X., Wang, S., Chen, X.: Optimal top-k generation of attribute combinations based on ranked lists. In: 2012 SIGMOD, pp. 409\u2013420 (2012)","DOI":"10.1145\/2213836.2213883"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-19094-0_13","volume-title":"WALCOM: Algorithms and Computation","author":"S Rahul","year":"2011","unstructured":"Rahul, S., Gupta, P., Janardan, R., Rajan, K.S.: Efficient top-k queries for orthogonal ranges. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 110\u2013121. Springer, Heidelberg (2011)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Suzuki, T., Takasu, A., Adachi, J.: $$Top$$ - $$k$$ query processing for combinatorial objects using Euclidean distance. In: IDEAS 11 Proceedings of the 15th Symposium on International Database Engineering and Applications, pp. 209\u2013213 (2011)","DOI":"10.1145\/2076623.2076651"},{"issue":"2","key":"36_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0304-3975(03)00228-7","volume":"307","author":"V Vajnovszki","year":"2003","unstructured":"Vajnovszki, V.: A loopless algorithm for generating the permutations of a multiset. Theor. Comput. Sci. 307(2), 415\u2013431 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"36_CR10","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1093\/ietfec\/e90-a.5.888","volume":"E90\u2013A","author":"K Yamanaka","year":"2007","unstructured":"Yamanaka, K., Kawano, S., Kikuchi, Y., Nakano, S.: Constant time generation of integer partitions. IEICE Trans. Fundam. E90\u2013A(5), 888\u2013895 (2007)","journal-title":"IEICE Trans. Fundam."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T18:25:55Z","timestamp":1747160755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}