Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50].
Matthew D. WilliamsonK. SubramaniPublished in: J. Discrete Algorithms (2016)
Keyphrases
- theoretical analysis
- orders of magnitude
- computational efficiency
- genetic algorithm
- computational complexity
- computational cost
- computationally expensive
- special issue
- social networks
- significant improvement
- optimization problems
- computationally efficient
- complex networks
- continuous domains
- probabilistic networks
- computational geometry