Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs.
Steven HomerMarcus PeinadoPublished in: Cliques, Coloring, and Satisfiability (1993)
Keyphrases
- approximation algorithms
- undirected graph
- special case
- np hard
- maximum clique
- minimum cost
- vertex cover
- worst case
- approximation ratio
- approximation guarantees
- np hardness
- facility location problem
- graph properties
- graph matching
- quasi cliques
- graph theory
- constant factor
- open shop
- primal dual
- set cover
- graph theoretic
- spanning tree
- approximation schemes
- network flow
- graph mining
- planar graphs
- randomized algorithms
- polynomial time approximation
- bipartite graph
- disjoint paths
- computational complexity
- combinatorial auctions
- weighted graph
- directed graph
- complex networks
- linear programming
- constant factor approximation