Login / Signup
On the Approximability of the Minimum Weight $t$-partite Clique Problem.
Geoffrey Solano
Guillaume Blin
Mathieu Raffinot
Jhoirene B. Clemente
Jaime Caro
Published in:
J. Graph Algorithms Appl. (2020)
Keyphrases
</>
minimum weight
maximum weight
bipartite graph
weighted graph
greedy heuristic
spanning tree
graph structure
maximum cardinality
approximation algorithms
minimum spanning tree
tree patterns
image segmentation
graph theory
shortest path
edge weights
multi class
randomized algorithm
np hard
multiscale