A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices

MLA

Li, Xingfu, and Daming Zhu. A 4/3-Approximation Algorithm for Finding a Spanning Tree to Maximize Its Internal Vertices. 2014. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.1409.3700&authtype=sso&custid=ns315887.

APA

Li, X., & Zhu, D. (2014). A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices.

Chicago

Li, Xingfu, and Daming Zhu. 2014. “A 4/3-Approximation Algorithm for Finding a Spanning Tree to Maximize Its Internal Vertices.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.1409.3700&authtype=sso&custid=ns315887.