Pages that link to "Item:Q4965094"
From MaRDI portal
The following pages link to A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem (Q4965094):
Displaying 5 items.
- Clustering on \(k\)-edge-colored graphs (Q335326) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Clustering as a dual problem to colouring (Q2140780) (← links)
- Clustering on k-Edge-Colored Graphs (Q2849897) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)