Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0356-7
Abstract: We consider a variety of NP-Complete network connectivity problems. We introduce a novel dual-based approach to approximating network design problems with cut-based linear programming relaxations. This approach gives a 3/2-approximation to Minimum 2-Edge-Connected Spanning Subgraph… read more here.
Keywords: network; approximation; connectivity problems; network connectivity ... See more keywords