$$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking

DOI10.1007/978-3-319-12691-3_36zbMath1420.68081OpenAlexW45051198MaRDI QIDQ2942423

Subhashis Majumder, Soumik Sinha, Biswajit Sanyal, Wing-Kai Hon, Prosenjit Gupta, Shiladitya Pande

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_36

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (2)

Efficient Generation of Top-k Procurements in a Multi-item Auction ⋮ Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions

This page was built for publication: $$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking