## Robust and Efficient Monitor Placement for Network Tomography in Dynamic Networks

- Ting He, Athanasios Gkelias, Liang Ma, Kin K. Leung, Ananthram Swami, Don Towsley
- IEEE/ACM Transactions on Networking
- 2017

Highly Influenced

@article{Ruf2004SetCW, title={Set covering with almost consecutive ones property}, author={Nikolaus Ruf and Anita Sch{\"o}bel}, journal={Discrete Optimization}, year={2004}, volume={1}, pages={215-228} }

- Published 2004 in Discrete Optimization
DOI:10.1016/j.disopt.2004.07.002

In this paper we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in most rows of the coefficient matrix, the ones appear consecutively and only a few blocks of consecutive ones appear in the remaining rows. If this property holds for all rows it is well known that the set covering problem can be solved efficiently. For our case of almost consecutive ones we present a reformulation exploiting the consecutive ones structure to develop… CONTINUE READING