{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:42Z","timestamp":1750307682322,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,21]],"date-time":"2009-06-21T00:00:00Z","timestamp":1245542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["MOEHRD (KRF-2008-313-D00897)"],"award-info":[{"award-number":["MOEHRD (KRF-2008-313-D00897)"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,21]]},"DOI":"10.1145\/1582379.1582410","type":"proceedings-article","created":{"date-parts":[[2009,8,4]],"date-time":"2009-08-04T13:38:06Z","timestamp":1249393086000},"page":"138-142","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Modeling and algorithm for topology construction with delay and traffic constraints"],"prefix":"10.1145","author":[{"given":"Yong-Jin","family":"Lee","sequence":"first","affiliation":[{"name":"Korea National University of Education, Chungbuk, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong-Woo","family":"Lee","sequence":"additional","affiliation":[{"name":"Woosong University, Daejeon, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"342","article-title":"Physical topology discovery for large multi subnet networks","author":"Bejerano Y.","year":"2003","journal-title":"INFOCOM"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.53.0142"},{"key":"e_1_3_2_1_3_1","first-page":"139","article-title":"Parallel Savings Heuristic for the Topological Design of Local Access Tree Networks","author":"Gavish B.","year":"1986","journal-title":"INFOCOM"},{"key":"e_1_3_2_1_4_1","first-page":"90","article-title":"Topology discovery by active probing","author":"Huffaker B.","year":"2002","journal-title":"Applications and the Internet (SAINT) Workshops"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2005.01.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com:20060544"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou \"The Complexity of the Capacitated Tree Problem Networks \" vol. 8 pp. 217--230 1978.  C. H. Papadimitriou \"The Complexity of the Capacitated Tree Problem Networks \" vol. 8 pp. 217--230 1978.","DOI":"10.1002\/net.3230080306"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/844382.845348"},{"key":"e_1_3_2_1_9_1","unstructured":"R. Sedgewick Algorithms Addison-Wesley pp. 452--461 1989.  R. Sedgewick Algorithms Addison-Wesley pp. 452--461 1989."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095845"},{"key":"e_1_3_2_1_11_1","first-page":"364","volume-title":"Oxford University Press","author":"Zheng Y.","year":"2000"}],"event":{"name":"IWCMC '09: 2009 International Wireless Communications and Mobile Computing Conference","sponsor":["ACM Association for Computing Machinery","Wiley-Blackwell","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGCOMM ACM Special Interest Group on Data Communication","SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","SIGDOC ACM Special Interest Group for Design of Communications"],"location":"Leipzig Germany","acronym":"IWCMC '09"},"container-title":["Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1582379.1582410","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1582379.1582410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:46Z","timestamp":1750253386000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1582379.1582410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,21]]},"references-count":11,"alternative-id":["10.1145\/1582379.1582410","10.1145\/1582379"],"URL":"https:\/\/doi.org\/10.1145\/1582379.1582410","relation":{},"subject":[],"published":{"date-parts":[[2009,6,21]]},"assertion":[{"value":"2009-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}