An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs-Reference-Cited by-同舟云学术

An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs

Published:1998 Issue: Volume: Page:126-136
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Cheriyan Joseph,Sebő András,Szigeti Zoltán

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-69346-7_10

Reference13 articles.

1. Lect Notes Comput Sci;R. Carr,1998

2. J. Cheriyan and R. Thurimella. Approximating minimum-size k-connected spanning subgraphs via matching. Proc. 37th Annual IEEE Sympos. on Foundat. of Comput. Sci., pages 292–301, 1996.

3. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, G.S.I.A., Carnegie-Mellon Univ., Pittsburgh, PA, 1976.

4. A. Frank. Conservative weightings and ear-decompositions of graphs. Combinatorica, 13:65–81, 1993.

5. G. L. Frederickson and J. Ja’Ja’. On the relationship between the biconnectivity augmentation and traveling salesman problems. Theor. Comp. Sci., 19:189–201, 1982.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16

2. Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points;LATIN 2012: Theoretical Informatics;2012

3. Maintaining Connectivity in Sensor Networks Using Directional Antennae;Monographs in Theoretical Computer Science;2010-11-08

4. Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs;Combinatorial Optimization and Applications;2010

5. An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree;Discrete Applied Mathematics;2003-03