A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.
Sylvia C. BoydJoseph CheriyanRobert CummingsLogan GroutSharat IbrahimpurZoltán SzigetiLu WangPublished in: CoRR (2020)
Keyphrases
- computational cost
- experimental evaluation
- optimization algorithm
- learning algorithm
- computational complexity
- cost function
- worst case
- detection algorithm
- high accuracy
- k means
- dynamic programming
- times faster
- segmentation algorithm
- np hard
- matching algorithm
- theoretical analysis
- neural network
- significant improvement
- simulated annealing
- preprocessing
- multiscale
- probabilistic model
- graph structure
- piecewise constant
- constant factor
- randomized approximation