Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.
Yuichi AsahiroYuya DoiEiji MiyanoHirotaka ShimizuPublished in: COCOA (2015)
Keyphrases
- approximation algorithms
- np hard
- vertex cover
- worst case
- maximum distance
- approximation schemes
- randomized algorithms
- minimum cost
- constant factor
- np hardness
- special case
- np complete
- open shop
- network design problem
- optimal solution
- primal dual
- linear programming
- greedy heuristic
- branch and bound algorithm
- lower bound
- objective function