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