Approximability of the vertex cover problem in power-law graphs.
Mikael GastMathias HauptmannPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- power law
- vertex cover
- approximation algorithms
- small world
- planar graphs
- polynomial time approximation
- real world graphs
- degree distribution
- np hard
- undirected graph
- random graphs
- scale free
- special case
- precedence constraints
- partial order
- worst case
- minimum cost
- clustering coefficient
- preferential attachment
- approximation guarantees
- optimality criterion
- power law distribution
- social networks
- graph theoretic
- approximation ratio
- weighted graph
- information theoretic