Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs.
Nadine SchwartgesJoachim SpoerhaseAlexander WolffPublished in: WAOA (2011)
Keyphrases
- approximation algorithms
- np hard
- undirected graph
- special case
- minimum cost
- vertex cover
- worst case
- spanning tree
- np complete
- facility location problem
- network design problem
- approximation ratio
- np hardness
- approximation schemes
- set cover
- lower bound
- scheduling problem
- primal dual
- integrality gap
- equivalence classes
- exact algorithms
- integer programming
- open shop
- linear programming
- branch and bound algorithm
- disjoint paths
- precedence constraints
- directed graph
- upper bound
- computational complexity
- interval data
- randomized algorithms
- optimal solution
- constant factor approximation
- polynomial time approximation
- greedy heuristic
- knapsack problem
- mathematical model
- search algorithm