Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph

Edward Gimadi. Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph. Applied Mathematics and Computation, 255:84-91, 2015. [doi]

@article{Gimadi15,
  title = {Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph},
  author = {Edward Gimadi},
  year = {2015},
  doi = {10.1016/j.amc.2014.11.037},
  url = {http://dx.doi.org/10.1016/j.amc.2014.11.037},
  researchr = {https://researchr.org/publication/Gimadi15},
  cites = {0},
  citedby = {0},
  journal = {Applied Mathematics and Computation},
  volume = {255},
  pages = {84-91},
}