How to allocate review tasks for robust ranking

DOI10.1007/s00236-010-0120-9zbMath1210.90166OpenAlexW2130917781MaRDI QIDQ707596

Asaf Levin, Dorit S. Hochbaum

Publication date: 8 October 2010

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-010-0120-9

zbMATH Keywords

\(k\)-allocation problem\(k\)-complete allocation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings ⋮ An axiomatic distance methodology for aggregating multimodal evaluations

Cites Work

• Fuzzy multiple criteria decision making: Recent developments
• A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
• The computational difficulty of manipulating an election
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Finding a Smallest Augmentation to Biconnect a Graph
• Note—A Preference Ranking Organisation Method
• Two algorithms for weighted matroid intersection
• Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
• The NP-Completeness of Some Edge-Partition Problems
• Augmentation Problems
• Smallest Augmentations to Biconnect a Graph
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Faster Scaling Algorithms for Network Problems
• Greedily Finding a Dense Subgraph
• The Perron–Frobenius Theorem and the Ranking of Football Teams
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• The dense \(k\)-subgraph problem

This page was built for publication: How to allocate review tasks for robust ranking