Cite
Buffered Steiner Trees for Difficult Instances.
MLA
Alpert, Charles J., et al. “Buffered Steiner Trees for Difficult Instances.” IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems, vol. 21, no. 1, Jan. 2002, p. 3. 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=asx&AN=5851427&authtype=sso&custid=ns315887.
APA
Alpert, C. J., Gandham, G., Hrkic, M., Hu, J., Kahng, A. B., Lillis, J., Bao Liiu, Quay, S. T., Sapatnekar, S. S., & Sullivan, A. J. (2002). Buffered Steiner Trees for Difficult Instances. IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems, 21(1), 3.
Chicago
Alpert, Charles J., Gopal Gandham, Milos Hrkic, Jiang Hu, Andrew B. Kahng, John Lillis, Bao Liiu, Stephen T. Quay, Sachin S. Sapatnekar, and A. J. Sullivan. 2002. “Buffered Steiner Trees for Difficult Instances.” IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems 21 (1): 3. 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=asx&AN=5851427&authtype=sso&custid=ns315887.