Fully Polynomial-Time Approximation Schemes for the Max-Min Connected Partition Problem on Interval Graphs.
Bang Ye WuPublished in: Discret. Math. Algorithms Appl. (2012)
Keyphrases
- max min
- approximation schemes
- approximation algorithms
- min max
- special case
- np hard
- worst case
- bounded treewidth
- polynomial time complexity
- connected graphs
- hill climbing
- robust optimization
- numerical methods
- graph theoretic
- minimum cost
- neural network
- computational complexity
- bin packing
- weighted graph
- dynamic programming
- decision making