Cite
Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing.
MLA
Danny Segev, and Gil Segev. “Approximate K-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing.” Algorithmica, vol. 56, no. 4, Apr. 2010, pp. 529–49. EBSCOhost, https://doi.org/10.1007/s00453-008-9189-8.
APA
Danny Segev, & Gil Segev. (2010). Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. Algorithmica, 56(4), 529–549. https://doi.org/10.1007/s00453-008-9189-8
Chicago
Danny Segev, and Gil Segev. 2010. “Approximate K-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing.” Algorithmica 56 (4): 529–49. doi:10.1007/s00453-008-9189-8.