A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem.
Ali ÇivrilPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- np hard
- experimental evaluation
- dynamic programming
- search space
- optimization algorithm
- high accuracy
- learning algorithm
- detection algorithm
- worst case
- computational cost
- optimal solution
- cost function
- approximation ratio
- error bounds
- expectation maximization
- linear programming
- computational complexity
- preprocessing
- probabilistic model
- decision trees
- image processing
- multiscale
- search algorithm
- social networks
- genetic algorithm
- energy function
- closed form
- recognition algorithm
- weighted graph
- undirected graph
- constant factor