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 9 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)
- Degreewidth: A New Parameter for Solving Problems on Tournaments (Q6496550) (← links)
