A polynomial algorithm for solving a general max-min fairness problem.
Artur TomaszewskiPublished in: Eur. Trans. Telecommun. (2005)
Keyphrases
- max min
- learning algorithm
- cost function
- objective function
- dynamic programming
- computational complexity
- min max
- optimal solution
- search space
- special case
- artificial neural networks
- np hard
- worst case
- particle swarm optimization
- constraint satisfaction problems
- combinatorial optimization
- convergence rate
- exhaustive search
- randomized approximation