Pages that link to "Item:Q716309"
From MaRDI portal
The following pages link to Average parameterization and partial kernelization for computing medians (Q716309):
Displaying 17 items.
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Voting rules as error-correcting codes (Q899434) (← links)
- Sampling and learning Mallows and generalized Mallows models under the Cayley distance (Q1703017) (← links)
- Exploring the median of permutations problem (Q1711664) (← links)
- Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Space reduction constraints for the median of permutations problem (Q2181257) (← links)
- Automedian sets of permutations: direct sum and shuffle (Q2220835) (← links)
- The linear ordering problem revisited (Q2629715) (← links)
- Medians of Permutations: Building Constraints (Q2795953) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Partial Kernelization for Rank Aggregation: Theory and Experiments (Q3058689) (← links)
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← links)
- Cluster Editing in Multi-Layer and Temporal Graphs. (Q5091014) (← links)
- Partially Polynomial Kernels for Set Cover and Test Cover (Q5741085) (← links)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)
- Cluster editing for multi-layer and temporal graphs (Q6635696) (← links)
