Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization

Frank Neumann, Marco Laumanns. Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization. In José R. Correa, Alejandro Hevia, Marcos A. Kiwi, editors, LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings. Volume 3887 of Lecture Notes in Computer Science, pages 745-756, Springer, 2006. [doi]

@inproceedings{NeumannL06,
  title = {Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization},
  author = {Frank Neumann and Marco Laumanns},
  year = {2006},
  doi = {10.1007/11682462_68},
  url = {http://dx.doi.org/10.1007/11682462_68},
  tags = {optimization},
  researchr = {https://researchr.org/publication/NeumannL06},
  cites = {0},
  citedby = {0},
  pages = {745-756},
  booktitle = {LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings},
  editor = {José R. Correa and Alejandro Hevia and Marcos A. Kiwi},
  volume = {3887},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-32755-X},
}