Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts.
Alexis CornetChristian LaforestPublished in: Discret. Math. Theor. Comput. Sci. (2017)
Keyphrases
- vertex cover
- steiner tree
- approximation algorithms
- minimum spanning tree
- planar graphs
- partial order
- shortest path
- precedence constraints
- facility location
- optimality criterion
- np hard
- log likelihood
- single machine scheduling problem
- connected components
- polynomial time approximation
- evaluation function
- undirected graph
- linear programming relaxation
- social network analysis