An efficient algorithm for generalized minimum spanning tree problem

He Jiang, Yudong Chen. An efficient algorithm for generalized minimum spanning tree problem. In Martin Pelikan, Jürgen Branke, editors, Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010. pages 217-224, ACM, 2010. [doi]

@inproceedings{JiangC10-2,
  title = {An efficient algorithm for generalized minimum spanning tree problem},
  author = {He Jiang and Yudong Chen},
  year = {2010},
  doi = {10.1145/1830483.1830525},
  url = {http://doi.acm.org/10.1145/1830483.1830525},
  researchr = {https://researchr.org/publication/JiangC10-2},
  cites = {0},
  citedby = {0},
  pages = {217-224},
  booktitle = {Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010},
  editor = {Martin Pelikan and Jürgen Branke},
  publisher = {ACM},
  isbn = {978-1-4503-0072-5},
}