Pages that link to "Item:Q483409"
From MaRDI portal
The following pages link to 2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409):
Displaying 6 items.
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
- A numerical method for solving retrospective inverse problem of fractional parabolic equation (Q2146336) (← links)
- A randomized algorithm for two-cluster partition of a set of vectors (Q2354448) (← links)
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)
- On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
