Hardness of robust network design
- 作者C. Chekuri; F.B. Shepherd; G. Oriolo; M.G. Scutellá
- 卷第50卷
- 期第1期
- 印刷ISSN0028-3045
- 电子ISSN1097-0037
- 文件大小134.90KB
- 发表时间2007
- DOI10.1002/net.20165
- 页码50-54
同作者推荐
k-Broadcasting in treesHovhannes A. Harutyunyan; Arthur L. Liestman · 2001
Nonadaptive broadcasting in treesHovhannes A. Harutyunyan; Arthur L. Liestman; Kazuhisa Makino; Thomas C. Shermer · 2011
On broadcasting in unicyclic graphsHovhannes A. Harutyunyan; Edward Maraachlian · 2008
Diametral broadcast graphsGrigoryan, Hayk; Harutyunyan, Hovhannes A. · Discrete Applied Mathematics · 2014
An efficient heuristic for broadcasting in networksHovhannes A. Harutyunyan; Bin Shao · 2006
On the monotonicity of the broadcast functionHovhannes A. Harutyunyan; Arthur L. Liestman · 2003
An Efficient Vertex Addition Method for Broadcast NetworksHarutyunyan, Hovhannes A. · Internet Mathematics · 2008