An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover.
Yusuke KobayashiTakashi NoguchiPublished in: ISAAC (2023)
Keyphrases
- preprocessing
- dynamic programming
- computational complexity
- search space
- np hard
- learning algorithm
- k means
- optimization algorithm
- optimal solution
- probabilistic model
- edge detection algorithm
- approximation ratio
- undirected graph
- recognition algorithm
- closed form
- matching algorithm
- computational cost
- bayesian networks
- error bounds
- detection algorithm
- simulated annealing