A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix.
Carl-Christian KanneGuido MoerkottePublished in: VLDB (2006)
Keyphrases
- approximation algorithms
- worst case
- minimum cost
- constant factor
- np hard
- special case
- vertex cover
- spanning tree
- approximation schemes
- facility location problem
- primal dual
- steiner tree
- approximation guarantees
- network design problem
- tree structure
- strongly np hard
- upper bound
- winner determination
- randomized algorithms
- open shop
- greedy heuristic
- network flow
- precedence constraints
- optimal solution
- leaf nodes
- combinatorial auctions
- set cover
- finding optimal
- undirected graph
- greedy algorithm
- index structure
- lower bound