Parameterized top-\(K\) algorithms
From MaRDI portal
Publication:1935815
DOI10.1016/j.tcs.2012.10.052zbMath1259.68078OpenAlexW1973679146MaRDI QIDQ1935815
Fenghui Zhang, Ge Xia, Jie Meng, Jian'er Chen, Iyad A. Kanj
Publication date: 19 February 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.052
Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Extended formulations for vertex cover ⋮ Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions ⋮ Worst-case analysis of clique MIPs
This page was built for publication: Parameterized top-\(K\) algorithms
