A note on iterated rounding for the survivable network design problem
© Chandra Chekuri and Thapanapong Rukkanchanunt. 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...
Saved in:
Main Authors: | Chandra Chekuri, Thapanapong Rukkanchanunt |
---|---|
格式: | Conference Proceeding |
出版: |
2018
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85040686269&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/58837 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Chiang Mai University |
相似書籍
-
On element-connectivity preserving graph simplification
由: Chandra Chekuri, et al.
出版: (2018) -
On element-connectivity preserving graph simplification
由: Chandra Chekuri, et al.
出版: (2018) -
Iterative methods for the split feasibility problem and the fixed point problem in Banach spaces
由: Suthep Suantai, et al.
出版: (2019) -
An iterative method for solving proximal split feasibility problems and fixed point problems
由: Wongvisarut Khuangsatung, et al.
出版: (2020) -
Optimizing Location-Routing Problem using Iterative Combination of GA and VNS
由: Cheng Jiang, et al.
出版: (2019)