Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph.
Ján PlesníkPublished in: J. Comb. Optim. (2001)
Keyphrases
- minimum cost
- undirected graph
- spanning tree
- vertex set
- np hard
- edge weights
- approximation algorithms
- weighted graph
- adjacency matrix
- network flow
- random graphs
- capacity constraints
- minimum cost flow
- network flow problem
- strongly connected
- minimum weight
- optimal solution
- directed acyclic graph
- directed graph
- worst case
- lower bound
- edit operations