Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions
From MaRDI portal
Publication:2304567
DOI10.1016/j.tcs.2020.01.036zbMath1435.68073OpenAlexW3005176385MaRDI QIDQ2304567
Biswajit Sanyal, Prosenjit Gupta, Wing-Kai Hon, Subhashis Majumder
Publication date: 12 March 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.01.036
Combinatorics in computer science (68R05) Auctions, bargaining, bidding and selling, and other market models (91B26) Data structures (68P05) Information storage and retrieval of data (68P20)
Cites Work
- A dynamic data structure for top-\(k\) queries on uncertain data
- Parameterized top-\(K\) algorithms
- Efficient Generation of Top-k Procurements in a Multi-item Auction
- $$Top$$ - $$K$$ Query Retrieval of Combinations with Sum-of-Subsets Ranking
- Efficiently Generating k-Best Solutions to Procurement Auctions
- Finding the k Shortest Paths
This page was built for publication: Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions
