文章基本信息

标题：A Note on Iterated Rounding for the Survivable Network Design Problem
本地全文：下载
作者：Chandra Chekuri ; Thapanapong Rukkanchanunt
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2018
卷号：61
页码：2:1-2:10
DOI：10.4230/OASIcs.SOSA.2018.2
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：In this note we consider the survivable network design problem (SNDP) in undirected graphs. We make two contributions. The first is a new counting argument in the iterated rounding based 2-approximation for edge-connectivity SNDP (EC-SNDP) originally due to Jain. The second contribution is to make some connections between hypergraphic version of SNDP (Hypergraph-SNDP) introduced by Zhao, Nagamochi and Ibaraki, and edge and node-weighted versions of EC-SNDP and element-connectivity SNDP (Elem-SNDP). One useful consequence is a 2-approximation for Elem-SNDP that avoids the use of set-pair based relaxation and analysis.
关键词：survivable network design; iterated rounding; approximation; element connectivity