scientific article
From MaRDI portal
Publication:3549601
zbMath1232.68181MaRDI QIDQ3549601
Warren Schudy, Claire Kenyon-Mathieu
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Comparison-based interactive collaborative filtering, Rank aggregation: new bounds for MCx, Unnamed Item, Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists, Comparison-Based Interactive Collaborative Filtering, Robust Learning of Consumer Preferences, A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments, Space reduction constraints for the median of permutations problem, Kernel and fast algorithm for dense triplet inconsistency, Recurring Comparison Faults: Sorting and Finding the Minimum, Tight Localizations of Feedback Sets, An Exact Method for the Minimum Feedback Arc Set Problem, A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings, A new interpretation and derivation of the Swaps index, Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique, Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number, Unnamed Item, Approximate Condorcet partitioning: solving large-scale rank aggregation problems, Fixed-Parameter Algorithms for Kemeny Scores, Computing kemeny rankings from \(d\)-Euclidean preferences, On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems, Exploring the median of permutations problem, Experiments with Kemeny ranking: What works when?, Unnamed Item, Preference-based learning to rank, Beyond rankings: comparing directed acyclic graphs, Automedian sets of permutations: direct sum and shuffle, Kernels for feedback arc set in tournaments, The feedback arc set problem with triangle inequality is a vertex cover problem, Ranking and Drawing in Subexponential Time, Proportional Approval Voting, Harmonic k-median, and Negative Association, A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization, Simple, Robust and Optimal Ranking from Pairwise Comparisons, Linear programming based approximation algorithms for feedback set problems in bipartite tournaments, On the approximability of Dodgson and Young elections, A randomized approximation algorithm for computing bucket orders, Fixed-parameter tractability results for feedback set problems in tournaments, On the hardness of maximum rank aggregation problems, Average parameterization and partial kernelization for computing medians, Efficient algorithms for measuring the funnel-likeness of DAGs, A note on generalized rank aggregation, Partial Kernelization for Rank Aggregation: Theory and Experiments, Cluster Editing: Kernelization Based on Edge Cuts, On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems, Medians of Permutations: Building Constraints, Ranking tournaments with no errors. I: Structural description, Monocular extraction of 2.1D sketch using constrained convex optimization, Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems, Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number, An Algorithmic View of Voting, On width measures and topological problems on semi-complete digraphs, Using intransitive triads to determine final species richness of competition networks, Approximate minimum selection with unreliable comparisons, Fixed-parameter algorithms for Kemeny rankings, Improved Parameterized Algorithms for the Kemeny Aggregation Problem, Triangle packing in (sparse) tournaments: approximation and kernelization, Socially desirable approximations for dodgson’s voting rule, Unnamed Item, On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments, A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation