Opening book details…
About this Computer Science article
A Greedy Algorithm for the Minimum $$2$$ 2 -Connected $$M$$ M -Fold Dominating Set Problem by Shi, Yishuo; Zhang, Yaping; Zhang, Zhao; Wu, Weili is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Shi, Yishuo; Zhang, Yaping; Zhang, Zhao; Wu, Weili
- Publisher
- Springer US; Springer-Verlag; Kluwer Academic Publishers; Springer Science and Business Media LLC; Society for Mining, Metallurgy and Exploration Inc. (ISSN 1382-6905)
- Published
- 2014
- Field
- Computer Science (Physical Sciences)
More by Shi, Yishuo; Zhang, Yaping; Zhang, Zhao; Wu, Weili
Browse all works by Shi, Yishuo; Zhang, Yaping; Zhang, Zhao; Wu, Weili