{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:17:31Z","timestamp":1740097051936,"version":"3.37.3"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,10,5]],"date-time":"2014-10-05T00:00:00Z","timestamp":1412467200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2014M551740"],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002369","name":"Chongqing University","doi-asserted-by":"publisher","award":["KJTD201310"],"id":[{"id":"10.13039\/501100002369","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific and Technological Research Program of Chongqing Municipal Education Commission","award":["KJ130523"]},{"name":"CQUPT Research Fund for Young Scholars","award":["A2012-79"]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61309031, 61272400"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Municipal Natural Science Foundation of Chongqing","doi-asserted-by":"publisher","award":["cstc2013jcyjA40026"],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,10,5]]},"DOI":"10.1145\/2663761.2663763","type":"proceedings-article","created":{"date-parts":[[2014,10,14]],"date-time":"2014-10-14T12:29:24Z","timestamp":1413289764000},"page":"149-154","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["FAMOUS"],"prefix":"10.1145","author":[{"given":"Jun","family":"Huang","sequence":"first","affiliation":[{"name":"SCIE, Chongqing Univ. of Posts & Telecom., Chongqing, China"}]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[{"name":"SCIE, Chongqing Univ. of Posts & Telecom., Chongqing, China"}]},{"given":"Yin","family":"Ying","sequence":"additional","affiliation":[{"name":"SCIE, Chongqing Univ. of Posts & Telecom., Chongqing, China"}]},{"given":"Yi","family":"Sun","sequence":"additional","affiliation":[{"name":"SCIE, Chongqing Univ. of Posts & Telecom., Chongqing, China"}]},{"given":"Qiang","family":"Duan","sequence":"additional","affiliation":[{"name":"The Penn. State Univ., Abington, PA"}]},{"given":"Cong-cong","family":"Xing","sequence":"additional","affiliation":[{"name":"Nicholls State Univ., Thibodaux, LA"}]}],"member":"320","published-online":{"date-parts":[[2014,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.819168"},{"key":"e_1_3_2_1_2_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson , Computers and Intractability: A Guide to the Theory of NP-Completeness . San Francisco, CA : Freeman , 1979 . M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979."},{"issue":"6","key":"e_1_3_2_1_3_1","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"Takahashi H.","year":"1980","unstructured":"H. Takahashi and A. Matsuyama , \" An approximate solution for the Steiner problem in graphs ,\" Math. Japonica , vol. 24 , no. 6 , pp. 573 -- 577 , Nov. 1980 . H. Takahashi and A. Matsuyama, \"An approximate solution for the Steiner problem in graphs,\" Math. Japonica, vol. 24, no. 6, pp. 573--577, Nov. 1980.","journal-title":"Math. Japonica"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187035"},{"key":"e_1_3_2_1_5_1","first-page":"770","volume-title":"San Francisco","author":"Robins G.","year":"2000","unstructured":"G. Robins and A. Zelikovsky , \" Improved Steiner tree approximation in graphs,\" in Proc. 11th Annu. ACM-SIAM SODA , San Francisco , California , pp. 770 -- 779 , Jan. 2000 . G. Robins and A. Zelikovsky, \"Improved Steiner tree approximation in graphs,\" in Proc. 11th Annu. ACM-SIAM SODA, San Francisco, California, pp. 770--779, Jan. 2000."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095818"},{"key":"e_1_3_2_1_7_1","first-page":"243","volume-title":"Third Annu. ACM\/SIAM SODA","author":"Khuller S.","year":"1993","unstructured":"S. Khuller , B. Raghavachari , and N. Young , \" Balancing minimum spanning and shortest path trees,\" in Proc . Third Annu. ACM\/SIAM SODA , Austin, Texas , pp. 243 -- 250 , Jan. 1993 . S. Khuller, B. Raghavachari, and N. Young, \"Balancing minimum spanning and shortest path trees,\" in Proc. Third Annu. ACM\/SIAM SODA, Austin, Texas, pp. 243--250, Jan. 1993."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.720901"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.811420"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220105"},{"key":"e_1_3_2_1_11_1","first-page":"6","article-title":"On Approximating a Multicast Tree with Multiple Quality-of-Service Constraints","volume":"95","author":"Huang J.","year":"2005","unstructured":"J. Huang , Y. Ma , and Y. Tanaka , \" On Approximating a Multicast Tree with Multiple Quality-of-Service Constraints ,\", IEICE Transactions on Communications , vol. E95 -B, no. 6 , pp. 2005 --2012, June 2012. J. Huang, Y. Ma, and Y. Tanaka, \"On Approximating a Multicast Tree with Multiple Quality-of-Service Constraints,\", IEICE Transactions on Communications, vol. E95-B, no. 6, pp. 2005--2012, June 2012.","journal-title":"IEICE Transactions on Communications"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2012.2198970"},{"key":"e_1_3_2_1_13_1","volume-title":"IEICE Gen. Conf 2011","author":"Huang J.","year":"2011","unstructured":"J. Huang and Y. Tanaka , \" A Deployable E2E Quality-of-Service Routing Algorithm,\" in Proc . IEICE Gen. Conf 2011 , Tokyo, No.BS-4-8, pp.S-23-S -24, Mar. 2011 . J. Huang and Y. Tanaka, \"A Deployable E2E Quality-of-Service Routing Algorithm,\" in Proc. IEICE Gen. Conf 2011, Tokyo, No.BS-4-8, pp.S-23-S-24, Mar. 2011."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118644898"}],"event":{"name":"RACS '14: International Conference on Research in Adaptive and Convergent Systems","sponsor":["Winway Systems Winway Systems, Inc.","SIGAPP ACM Special Interest Group on Applied Computing","ACCT Association of Convergent Computing Technology","TU Towson University"],"location":"Towson Maryland","acronym":"RACS '14"},"container-title":["Proceedings of the 2014 Conference on Research in Adaptive and Convergent Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2663761.2663763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T08:48:26Z","timestamp":1673426906000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2663761.2663763"}},"subtitle":["a novel fast multi-constrained multicast routing algorithm"],"short-title":[],"issued":{"date-parts":[[2014,10,5]]},"references-count":16,"alternative-id":["10.1145\/2663761.2663763","10.1145\/2663761"],"URL":"https:\/\/doi.org\/10.1145\/2663761.2663763","relation":{},"subject":[],"published":{"date-parts":[[2014,10,5]]},"assertion":[{"value":"2014-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}