Danny Segev, Gil Segev. Approximate ::::k::::-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing. In Yossi Azar, Thomas Erlebach, editors, Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings. Volume 4168 of Lecture Notes in Computer Science, pages 600-611, Springer, 2006. [doi]
@inproceedings{SegevS06, title = {Approximate ::::k::::-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing}, author = {Danny Segev and Gil Segev}, year = {2006}, doi = {10.1007/11841036_54}, url = {http://dx.doi.org/10.1007/11841036_54}, researchr = {https://researchr.org/publication/SegevS06}, cites = {0}, citedby = {0}, pages = {600-611}, booktitle = {Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings}, editor = {Yossi Azar and Thomas Erlebach}, volume = {4168}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-38875-3}, }