Parameterized top-\(K\) algorithms
type: Item
instance of: scholarly article
title: Parameterized top-\(K\) algorithms
zbMATH Open document ID: 1259.68078
author: Jie Meng
author: Ge Xia
author: Fenghui Zhang
author: Jianer Chen
author: Iyad Kanj
published in: Theoretical Computer Science
publication date: 2013-02-19T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 6137358
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: enumeration algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.10.052
OpenAlex ID: W1973679146
DOI: 10.1016/J.TCS.2012.10.052
Recommended article: Fixed-parameter algorithms for Kemeny rankings
Recommended article: Parameterized algorithms and kernels for almost induced matching
Recommended article: Algorithms for generalized vertex-rankings of partial k-trees
Recommended article: Improved Parameterized Algorithms for the Kemeny Aggregation Problem
Recommended article: Parameterized Algorithms
Recommended article: Parameterized algorithmics for d-H<scp>itting</scp> S<scp>et</scp>
Recommended article: Top-\(k\) list aggregation: mathematical formulations and polyhedral comparisons
description: scientific article; zbMATH DE number 6137358