Aggregating inconsistent information
From MaRDI portal
Cited in
(47)- Statistical ranking and combinatorial Hodge theory
- Feedback arc set in bipartite tournaments is NP-complete
- Lower and upper bounds for the linear arrangement problem on interval graphs
- A more effective linear kernelization for cluster editing
- scientific article; zbMATH DE number 7650100 (Why is no real title available?)
- Finding small feedback arc sets on large graphs
- Fixed-parameter algorithms for cluster vertex deletion
- Clustering with Local Restrictions
- Improved Algorithms for Bicluster Editing
- Voting procedures, complexity of
- scientific article; zbMATH DE number 7525518 (Why is no real title available?)
- On the approximation of correlation clustering and consensus clustering
- A note on generalized rank aggregation
- NP-hardness results for the aggregation of linear orders into median orders
- scientific article; zbMATH DE number 7370524 (Why is no real title available?)
- Feedback arc set problem in bipartite tournaments
- Balanced allocations with the choice of noise
- Heuristic stability: a permutation disarray measure
- On the complexity of crossings in permutations
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Comparing multiagent systems research in combinatorial auctions and voting
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Closest 4-leaf power is fixed-parameter tractable
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Kernels for feedback arc set in tournaments
- A note on the inapproximability of correlation clustering
- Simple iterative heuristics for correlation clustering
- Efficient clustering of large uncertain graphs using neighborhood information
- Hardness of fully dense problems
- Socially desirable approximations for dodgson’s voting rule
- Tournaments and Semicomplete Digraphs
- Aggregation and decision making using ranked data
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- Experiments with Kemeny ranking: What works when?
- Quasi-hamiltonian paths in semicomplete multipartite digraphs
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Comparing and aggregating partially resolved trees
- Ensemble clustering using semidefinite programming with applications
- A randomized approximation algorithm for computing bucket orders
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- Preference-based learning to rank
- Computer science and decision theory
- Fixed-Parameter Algorithms for Kemeny Scores
- Cluster editing problem for points on the real line: a polynomial time algorithm
This page was built for publication: Aggregating inconsistent information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901110)
