Vertex Cover Gets Faster and Harder on Low Degree Graphs.
Akanksha AgrawalSathish GovindarajanNeeldhara MisraPublished in: COCOON (2014)
Keyphrases
- vertex cover
- low degree
- planar graphs
- approximation algorithms
- np hard
- precedence constraints
- partial order
- undirected graph
- uniform distribution
- np complete
- directed graph
- scheduling problem
- polynomial time approximation
- optimality criterion
- graph structure
- weighted graph
- bayesian networks
- theoretical analysis
- worst case
- special case