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

相似書籍