Inapproximability and a polynomially solvable special case of a network improvement problem.
Jianzhong ZhangXiaoguang YangMao-cheng CaiPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- special case
- polynomially solvable
- approximation algorithms
- np hard
- makespan minimization
- processing times
- np complete
- network structure
- network traffic
- peer to peer
- network resources
- minimum cost
- network model
- data sets
- feasible solution
- wireless sensor networks
- optimal solution
- computer networks
- computational complexity
- intrusion detection
- social networks
- network management
- artificial neural networks
- approximation ratio
- genetic algorithm
- neural network