Pages that link to "Item:Q5901110"
From MaRDI portal
The following pages link to Aggregating inconsistent information (Q5901110):
Displaying 45 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Experiments with Kemeny ranking: What works when? (Q449040) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Statistical ranking and combinatorial Hodge theory (Q633110) (← links)
- Comparing and aggregating partially resolved trees (Q650896) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Feedback arc set in bipartite tournaments is NP-complete (Q845963) (← links)
- Heuristic stability: a permutation disarray measure (Q883278) (← links)
- On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A note on the inapproximability of correlation clustering (Q975483) (← links)
- A randomized approximation algorithm for computing bucket orders (Q976119) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- A note on generalized rank aggregation (Q989442) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- A more effective linear kernelization for cluster editing (Q1006044) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- Aggregation and decision making using ranked data (Q1038271) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Cluster editing problem for points on the real line: a polynomial time algorithm (Q1675767) (← links)
- Efficient clustering of large uncertain graphs using neighborhood information (Q1678437) (← links)
- Quasi-hamiltonian paths in semicomplete multipartite digraphs (Q1949094) (← links)
- Ensemble clustering using semidefinite programming with applications (Q1959572) (← links)
- Preference-based learning to rank (Q1959596) (← links)
- NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists (Q2379921) (← links)
- Feedback arc set problem in bipartite tournaments (Q2380064) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (Q2947231) (← links)
- Clustering with Local Restrictions (Q3012850) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Improved Algorithms for Bicluster Editing (Q3502668) (← links)
- Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)
- Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
- (Q4998871) (← links)
- (Q5075830) (← links)
- Simple Iterative Heuristics for Correlation Clustering (Q5116365) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)
- Socially desirable approximations for dodgson’s voting rule (Q5501960) (← links)
- (Q5875489) (← links)
