Covering a tree with rooted subtrees - parameterized and approximation algorithms.
Lin ChenDániel MarxPublished in: SODA (2018)
Keyphrases
- approximation algorithms
- tree structure
- tree nodes
- np hard
- tree structures
- vertex cover
- special case
- minimum cost
- worst case
- facility location problem
- network design problem
- approximation ratio
- leaf nodes
- randomized algorithms
- constant factor
- tree patterns
- undirected graph
- primal dual
- disjoint paths
- approximation schemes
- frequent subtrees
- labeled trees
- set cover
- tree kernels
- spanning tree
- np hardness
- polynomial time approximation
- unordered trees
- precedence constraints
- combinatorial auctions
- xml trees
- branch and bound algorithm
- computational complexity