Algorithms for automatic ranking of participants and tasks in an anonymized contest

DOI10.1016/j.tcs.2018.07.014zbMath1430.68124arXiv1612.04794OpenAlexW3021384541WikidataQ129440085 ScholiaQ129440085MaRDI QIDQ2272379

R. Ravi, Wolfgang Gatterbauer, Yang Jiao

Publication date: 10 September 2019

Published in: Theoretical Computer Science, WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.04794

zbMATH Keywords

student evaluationtruth discoverychain additionchain editingmassively open online classes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items

Algorithms for automatic ranking of participants and tasks in an anonymized contest

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chordal editing is fixed-parameter tractable
• Approximating the Minimum Chain Completion problem
• On the threshold of intractability
• Algorithms for automatic ranking of participants and tasks in an anonymized contest
• Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
• Authoritative sources in a hyperlinked environment
• Computing the Minimum Fill-In is NP-Complete
• Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
• A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
• Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
• Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
• Inapproximability of Treewidth and Related Problems
• Subexponential Parameterized Algorithm for Minimum Fill-In