Efficient meta-data structure in top-k queries of combinations and multi-item procurement auctions

DOI10.1016/J.TCS.2020.01.036MaRDI QIDQ2304567zbMATH OpenOpenAlexFDO

Authors Biswajit Sanyal, Subhashis Majumder, Wing-Kai Hon, Prosenjit Gupta

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

zbMATH Keywords

metadata structureprocurement auctiontop-\(k\) queries

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Combinatorics in computer science (68R05) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Top - K Query Retrieval of Combinations with Sum-of-Subsets Ranking
• Efficient generation of top-\(k\) procurements in a multi-item auction
• Foundations of Information and Knowledge Systems
• Efficiently Generating k-Best Solutions to Procurement Auctions
• Efficient top-k queries for orthogonal ranges

Cites work

• Top - K Query Retrieval of Combinations with Sum-of-Subsets Ranking
• A dynamic data structure for top-\(k\) queries on uncertain data
• Efficient generation of top-\(k\) procurements in a multi-item auction
• Efficiently Generating k-Best Solutions to Procurement Auctions
• Finding the k Shortest Paths
• Parameterized top-\(K\) algorithms

Cited in

(1)

• Efficient generation of top-\(k\) procurements in a multi-item auction

This page was built for publication: Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2304567)