Pages that link to "Item:Q3169053"
From MaRDI portal
The following pages link to Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems (Q3169053):
Displaying 29 items.
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments (Q534571) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- Rank aggregation: new bounds for MCx (Q1630773) (← links)
- Exploring the median of permutations problem (Q1711664) (← links)
- Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Even better fixed-parameter algorithms for bicluster editing (Q2019506) (← links)
- A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
- Approximation algorithms for two variants of correlation clustering problem (Q2156281) (← links)
- Space reduction constraints for the median of permutations problem (Q2181257) (← links)
- Automedian sets of permutations: direct sum and shuffle (Q2220835) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- Multidimensional welfare rankings under weight imprecision: a social choice perspective (Q2348747) (← links)
- Medians of Permutations: Building Constraints (Q2795953) (← links)
- An Algorithmic View of Voting (Q2827491) (← links)
- COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES (Q2846476) (← links)
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (Q2947231) (← links)
- The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders (Q3004688) (← links)
- Partial Kernelization for Rank Aggregation: Theory and Experiments (Q3058689) (← links)
- Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)
- Metric-Constrained Optimization for Graph Clustering Algorithms (Q5025762) (← links)
- Robust Learning of Consumer Preferences (Q5080653) (← links)
- (Q5091036) (← links)
- Cluster Editing (Q5326357) (← links)
