Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique.

Arun Jagota Laura A. Sanchis

Published in: J. Heuristics (2001)

Keyphrases

greedy heuristics
maximum clique
scheduling problem
set cover
random walk
natural language processing
greedy algorithm
association graph
information retrieval
relational databases
branch and bound algorithm
graph theoretic