Cite
APPROXIMATION ALGORITHMS FOR MINIMUM-COST k-(S, T) CONNECTED DIGRAPHS.
MLA
Cheriyan, J., and B. Laekhanukit. “APPROXIMATION ALGORITHMS FOR MINIMUM-COST k-(S, T) CONNECTED DIGRAPHS.” SIAM Journal on Discrete Mathematics, vol. 27, no. 3, July 2013, pp. 1450–81. EBSCOhost, https://doi.org/10.1137/100818728.
APA
Cheriyan, J., & Laekhanukit, B. (2013). APPROXIMATION ALGORITHMS FOR MINIMUM-COST k-(S, T) CONNECTED DIGRAPHS. SIAM Journal on Discrete Mathematics, 27(3), 1450–1481. https://doi.org/10.1137/100818728
Chicago
Cheriyan, J., and B. Laekhanukit. 2013. “APPROXIMATION ALGORITHMS FOR MINIMUM-COST k-(S, T) CONNECTED DIGRAPHS.” SIAM Journal on Discrete Mathematics 27 (3): 1450–81. doi:10.1137/100818728.