Polynomially solvable special cases of the Steiner problem in planar networks.
Marshall W. BernDaniel BienstockPublished in: Ann. Oper. Res. (1991)
Keyphrases
- polynomially solvable
- special case
- np hard
- makespan minimization
- np complete
- processing times
- feasible solution
- approximation algorithms
- social networks
- network analysis
- network structure
- computer networks
- computational complexity
- minimum cost
- neural network
- linear programming
- scheduling problem
- high dimensional
- ground plane
- objective function