Approximation algorithm for the minimum weight connected k-subgraph cover problem

Yaping Zhang, Yishuo Shi, Zhao Zhang. Approximation algorithm for the minimum weight connected k-subgraph cover problem. Theoretical Computer Science, 535:54-58, 2014. [doi]

@article{ZhangSZ14-1,
  title = {Approximation algorithm for the minimum weight connected k-subgraph cover problem},
  author = {Yaping Zhang and Yishuo Shi and Zhao Zhang},
  year = {2014},
  doi = {10.1016/j.tcs.2014.03.026},
  url = {http://dx.doi.org/10.1016/j.tcs.2014.03.026},
  researchr = {https://researchr.org/publication/ZhangSZ14-1},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {535},
  pages = {54-58},
}