Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.
Yuichi AsahiroTomohiro KuboEiji MiyanoPublished in: SCIS&ISIS (2016)
Keyphrases
- approximation algorithms
- experimental evaluation
- np hard
- vertex cover
- maximum distance
- np hardness
- approximation schemes
- special case
- network design problem
- randomized algorithms
- exact algorithms
- search algorithm
- polynomial time approximation
- practical problems
- np complete
- worst case
- reduction method
- primal dual
- set cover
- combinatorial auctions
- random walk
- optimal solution
- disjoint paths