Pages that link to "Item:Q5119375"
From MaRDI portal
The following pages link to On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375):
Displaying 3 items.
- 2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409) (← links)
- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances (Q2163779) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)