Pages that link to "Item:Q3453278"
From MaRDI portal
The following pages link to Improved Approximations for the Max k-Colored Clustering Problem (Q3453278):
Displaying 6 items.
- Clustering on \(k\)-edge-colored graphs (Q335326) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
- Clustering as a dual problem to colouring (Q2140780) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem (Q4965094) (← links)