Login / Signup
Proving NP-hardness for clique-width II: non-approximability of clique-width
Michael R. Fellows
Frances A. Rosamond
Udi Rotics
Stefan Szeider
Published in:
Electron. Colloquium Comput. Complex. (2005)
Keyphrases
</>
np hardness
approximation algorithms
np hard
linear programming
maximum weight
computational complexity
probabilistic model
particle swarm optimization
particle filter