How to allocate review tasks for robust ranking
type: Item
instance of: scholarly article
title: How to allocate review tasks for robust ranking
zbMATH Open document ID: 1210.90166
author: Dorit S. Hochbaum
author: Asaf Levin
published in: Acta Informatica
publication date: 2010-10-08T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5797364
zbMATH Keywords: \(k\)-allocation problem
zbMATH Keywords: \(k\)-complete allocation
MaRDI profile type: Publication
full work available at URL: s00236-010-0120-9
OpenAlex ID: W2130917781
cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee
cites work: Greedily Finding a Dense Subgraph
cites work: The computational difficulty of manipulating an election
cites work: Note—A Preference Ranking Organisation Method
cites work: Two algorithms for weighted matroid intersection
cites work: A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
cites work: Augmentation Problems
cites work: The dense \(k\)-subgraph problem
cites work: Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
cites work: Fuzzy multiple criteria decision making: Recent developments
cites work: Faster Scaling Algorithms for Network Problems
cites work: The NP-Completeness of Some Edge-Partition Problems
cites work: Finding a Smallest Augmentation to Biconnect a Graph
cites work: The Perron–Frobenius Theorem and the Ranking of Football Teams
cites work: Smallest Augmentations to Biconnect a Graph
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
DOI: 10.1007/S00236-010-0120-9
description: scientific article; zbMATH DE number 5797364