Pages that link to "Item:Q492279"
From MaRDI portal
The following pages link to Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279):
Displaying 4 items.
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances (Q2163779) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
