Complexity and approximation of the connected set-cover problem
| Year of publication: |
2012
|
|---|---|
| Authors: | Zhang, Wei ; Wu, Weili ; Lee, Wonjun ; Du, Ding-Zhu |
| Published in: |
Journal of Global Optimization. - Springer. - Vol. 53.2012, 3, p. 563-572
|
| Publisher: |
Springer |
| Subject: | Connected set-cover | Computational complexity | Approximation algorithms |
-
Approximate Local Search in Combinatorial Optimization
Orlin, James B., (2003)
-
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Klerk, Etienne, (2008)
-
The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey
de Klerk, Etienne, (2006)
- More ...
-
Complexity and approximation of the connected set-cover problem
Zhang, Wei, (2012)
-
On minimum submodular cover with submodular cost
Du, Hongjie, (2011)
-
Constructing weakly connected dominating set for secure clustering in distributed sensor network
Du, Hongjie, (2012)
- More ...