A 4/3-Approximation Algorithm for Minimum 3-Edge-connectivity

Prabhakar Gubbala,Balaji Raghavachari

Lecture Notes in Computer Science（2007）

Microsoft Corporation

被引用2|浏览0

摘要

The minimum cardinality 3-edge-connected spanning subgraph problem is considered. An approximation algorithm with a performance ratio of 4/3 ≈ 1.33 is presented. This improves the previous best ratio of 3/2 for the problem. The algorithm also works on multigraphs and guarantees the same approximation ratio.

更多

查看译文

关键词

Approximation algorithms,Graph and network algorithms,Connectivity,Combinatorial Optimization

上传PDF