Jegelka, S., & Bilmes, J. A. (2017). Graph cuts with interacting edge weights: Examples, approximations, and algorithms. Mathematical programming, 162(1-2), 241-282. https://doi.org/10.1007/s10107-016-1038-y
Chicago Style (17th ed.) CitationJegelka, Stefanie, and Jeff A. Bilmes. "Graph Cuts with Interacting Edge Weights: Examples, Approximations, and Algorithms." Mathematical Programming 162, no. 1-2 (2017): 241-282. https://doi.org/10.1007/s10107-016-1038-y.
MLA (9th ed.) CitationJegelka, Stefanie, and Jeff A. Bilmes. "Graph Cuts with Interacting Edge Weights: Examples, Approximations, and Algorithms." Mathematical Programming, vol. 162, no. 1-2, 2017, pp. 241-282, https://doi.org/10.1007/s10107-016-1038-y.
Warning: These citations may not always be 100% accurate.