Corrigendum to "A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem" [Theor. Comput. Sci. 943 (2023) 121-130].
Ali ÇivrilPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- cost function
- np hard
- detection algorithm
- computational complexity
- computational cost
- experimental evaluation
- high accuracy
- worst case
- dynamic programming
- optimal solution
- significant improvement
- optimization algorithm
- particle swarm optimization
- error bounds
- edge detector
- edge information
- tree structure
- energy function
- undirected graph
- neural network
- constant factor
- segmentation algorithm
- expectation maximization
- simulated annealing
- edge detection
- preprocessing
- objective function
- social networks
- learning algorithm
- genetic algorithm