Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs.
Sven Oliver KrumkePeter MerzTim NonnerKatharina RuppPublished in: OPODIS (2007)
Keyphrases
- approximation algorithms
- disjoint paths
- undirected graph
- np hard
- special case
- connected subgraphs
- minimum cost
- vertex cover
- worst case
- primal dual
- open shop
- set cover
- approximation ratio
- constant factor
- randomized algorithms
- machine learning
- graphical models
- probabilistic model
- computational complexity
- search algorithm
- optimal solution