{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:22Z","timestamp":1750306162148,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1145\/2980523.2980528","type":"proceedings-article","created":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T18:25:14Z","timestamp":1472754314000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Integer programming approach for directed minimum spanning tree problem on temporal graphs"],"prefix":"10.1145","author":[{"given":"Takuto","family":"Ikuta","sequence":"first","affiliation":[{"name":"The University of Tokyo, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takuya","family":"Akiba","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789813.2789820"},{"key":"e_1_3_2_1_2_1","volume-title":"The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)","author":"Applegate D. L.","year":"2007","unstructured":"D. L. Applegate , R. E. Bixby , V. Chvatal , and W. J. Cook . The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) . Princeton University Press , Princeton, NJ, USA , 2007 . D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook. The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton, NJ, USA, 2007."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1768570.1768609"},{"key":"e_1_3_2_1_4_1","first-page":"192","volume-title":"SODA","author":"Charikar M.","year":"1998","unstructured":"M. Charikar , C. Chekuri , T. Cheung , Z. Dai , A. Goel , S. Guha , and M. Li . Approximation algorithms for directed steiner problems . In SODA , pages 192 -- 200 , 1998 . M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed steiner problems. In SODA, pages 192--200, 1998."},{"issue":"10","key":"e_1_3_2_1_5_1","first-page":"1396","article-title":"On shortest arborescence of a directed graph","volume":"14","author":"Chu Y.-J.","year":"1965","unstructured":"Y.-J. Chu and T.-H. Liu . On shortest arborescence of a directed graph . Scientia Sinica , 14 ( 10 ): 1396 , 1965 . Y.-J. Chu and T.-H. Liu. On shortest arborescence of a directed graph. Scientia Sinica, 14(10):1396, 1965.","journal-title":"Scientia Sinica"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.7.1.58"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_8_1","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in a network with power estimation","volume":"11","author":"Dinitz Y. A.","year":"1970","unstructured":"Y. A. Dinitz . Algorithm for solution of a problem of maximum flow in a network with power estimation . Soviet Math Doklady , 11 : 1277 -- 1280 , 1970 . Y. A. Dinitz. Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math Doklady, 11:1277--1280, 1970.","journal-title":"Soviet Math Doklady"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579168"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/364099.364331"},{"key":"e_1_3_2_1_12_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 . W. H. Freeman , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723717"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24854-5_125"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"key":"e_1_3_2_1_19_1","first-page":"68","volume-title":"ALENEX","author":"Ljubic I.","year":"2005","unstructured":"I. Ljubic , R. Weiskircher , U. Pferschy , G. W. Klau , P. Mutzel , and M. Fischetti . Solving the prize-collecting steiner tree problem to optimality . In ALENEX , pages 68 -- 76 , 2005 . I. Ljubic, R. Weiskircher, U. Pferschy, G. W. Klau, P. Mutzel, and M. Fischetti. Solving the prize-collecting steiner tree problem to optimality. In ALENEX, pages 68--76, 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0660-x"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749456"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732945"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7363809"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498236"}],"event":{"name":"SIGMOD\/PODS'16: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","Xerox"],"location":"San Francisco California","acronym":"SIGMOD\/PODS'16"},"container-title":["Proceedings of the 1st ACM SIGMOD Workshop on Network Data Analytics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2980523.2980528","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2980523.2980528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:52Z","timestamp":1750217992000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2980523.2980528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":26,"alternative-id":["10.1145\/2980523.2980528","10.1145\/2980523"],"URL":"https:\/\/doi.org\/10.1145\/2980523.2980528","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]},"assertion":[{"value":"2016-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}