Pages that link to "Item:Q5172725"
From MaRDI portal
The following pages link to Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems (Q5172725):
Displayed 6 items.
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
- Approximation complexity of metric dimension problem (Q450564) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Speeding up Graph Algorithms via Switching Classes (Q2946059) (← links)
- On Approximation Complexity of Metric Dimension Problem (Q3000502) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
