{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:05Z","timestamp":1750221305565,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,1,5]],"date-time":"2018-01-05T00:00:00Z","timestamp":1515110400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JST ERATO","award":["JPMJER1201"],"award-info":[{"award-number":["JPMJER1201"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,1,5]]},"DOI":"10.1145\/3164541.3164600","type":"proceedings-article","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T11:57:40Z","timestamp":1526471860000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Approximation Algorithm for Incrementally Deploying SDN Forwarding Devices"],"prefix":"10.1145","author":[{"given":"Xusheng","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vorapong","family":"Suppakitpaisarn","sequence":"additional","affiliation":[{"name":"The University of Tokyo, Bunkyo-ku, Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,1,5]]},"reference":[{"volume-title":"2013 Proceedings IEEE INFOCOM. 2211--2219","author":"Agarwal S.","key":"e_1_3_2_1_1_1","unstructured":"S. Agarwal , M. Kodialam , and T. V. Lakshman . 2013. Traffic engineering in software defined networks . In 2013 Proceedings IEEE INFOCOM. 2211--2219 . S. Agarwal, M. Kodialam, and T. V. Lakshman. 2013. Traffic engineering in software defined networks. In 2013 Proceedings IEEE INFOCOM. 2211--2219."},{"volume-title":"2013 IEEE Global Communications Conference (GLOBECOM). 1391--1396","author":"Caria M.","key":"e_1_3_2_1_2_1","unstructured":"M. Caria , A. Jukan , and M. Hoffmann . 2013. A performance study of network migration to SDN-enabled Traffic Engineering . In 2013 IEEE Global Communications Conference (GLOBECOM). 1391--1396 . M. Caria, A. Jukan, and M. Hoffmann. 2013. A performance study of network migration to SDN-enabled Traffic Engineering. In 2013 IEEE Global Communications Conference (GLOBECOM). 1391--1396."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602204.2602219"},{"key":"e_1_3_2_1_4_1","unstructured":"Moran Feldman and Rani Izsak. 2014. Constrained Monotone Function Maximization and the Supermodular Degree. In APPROX-RANDOM'14. 160--175.  Moran Feldman and Rani Izsak. 2014. Constrained Monotone Function Maximization and the Supermodular Degree. In APPROX-RANDOM'14. 160--175."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/PCCC.2015.7410320"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IFIPNetworking.2015.7145321"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890959"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_3_2_1_10_1","unstructured":"Andreas Krause and Daniel Golovin. 2012. Submodular Function Maximization. (2012) 28. https:\/\/las.inf.ethz.ch\/files\/krause12survey.pdf  Andreas Krause and Daniel Golovin. 2012. Submodular Function Maximization. (2012) 28. https:\/\/las.inf.ethz.ch\/files\/krause12survey.pdf"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2371999"},{"key":"e_1_3_2_1_12_1","volume-title":"INFOCOM'02","volume":"2","author":"Krishnamachari Bhaskar","year":"2002","unstructured":"Bhaskar Krishnamachari , Deborah Estrin , and Stephen Wicker . 2002 . Modelling data-centric routing in wireless sensor networks . In INFOCOM'02 , Vol. 2 . 39--44. Bhaskar Krishnamachari, Deborah Estrin, and Stephen Wicker. 2002. Modelling data-centric routing in wireless sensor networks. In INFOCOM'02, Vol. 2. 39--44."},{"volume-title":"Computers and intractability: a guide to the theory of NP-completeness. WH Free","author":"Garey Michael R","key":"e_1_3_2_1_13_1","unstructured":"R Garey Michael and S Johnson David . 1979. Computers and intractability: a guide to the theory of NP-completeness. WH Free . Co . R Garey Michael and S Johnson David. 1979. Computers and intractability: a guide to the theory of NP-completeness. WH Free. Co."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057136"},{"key":"e_1_3_2_1_15_1","unstructured":"A. Soham. 2017. Finding the maximum bandwidth along a single path in a network. (2017). https:\/\/cs.stackexchange.com\/questions\/1591\/finding-the-maximum-bandwidth-along-a-single-path-in-a-netwo  A. Soham. 2017. Finding the maximum bandwidth along a single path in a network. (2017). https:\/\/cs.stackexchange.com\/questions\/1591\/finding-the-maximum-bandwidth-along-a-single-path-in-a-netwo"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.845549"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602204.2602216"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2330903"}],"event":{"name":"IMCOM '18: The 12th International Conference on Ubiquitous Information Management and Communication","sponsor":["SKKU SUNGKYUNKWAN UNIVERSITY"],"location":"Langkawi Malaysia","acronym":"IMCOM '18"},"container-title":["Proceedings of the 12th International Conference on Ubiquitous Information Management and Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3164541.3164600","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3164541.3164600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:27Z","timestamp":1750212807000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3164541.3164600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,5]]},"references-count":18,"alternative-id":["10.1145\/3164541.3164600","10.1145\/3164541"],"URL":"https:\/\/doi.org\/10.1145\/3164541.3164600","relation":{},"subject":[],"published":{"date-parts":[[2018,1,5]]},"assertion":[{"value":"2018-01-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}