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
de Klerk, Etienne, (2006)
-
The Aircraft Maintenance Base Location Problem
Gopalan, Ram, (2014)
- More ...
-
Complexity and approximation of the connected set-cover problem
Zhang, Wei, (2012)
-
On minimum submodular cover with submodular cost
Du, Hongjie, (2011)
-
New dominating sets in social networks
Zhu, Xu, (2010)
- More ...