{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T08:59:00Z","timestamp":1789721940033,"version":"4.0.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001782","name":"University of Melbourne","doi-asserted-by":"publisher","award":["LP140100670"],"award-info":[{"award-number":["LP140100670"]}],"id":[{"id":"10.13039\/501100001782","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/tnet.2018.2888864","type":"journal-article","created":{"date-parts":[[2019,1,8]],"date-time":"2019-01-08T22:19:07Z","timestamp":1546985947000},"page":"375-388","source":"Crossref","is-referenced-by-count":12,"title":["The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3730-8538","authenticated-orcid":false,"given":"Yahui","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcus","family":"Brazil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Doreen","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saman","family":"Halgamuge","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0308-5961(02)00013-7"},{"key":"ref38","year":"2018","journal-title":"Guidelines for Estimating CPLEX Memory Requirements Based on Problem Size"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-017-1958-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1985.10011"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77615"},{"key":"ref37","year":"2018","journal-title":"The M Instances and FGW Codes for PCSTP"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0479-2"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585864"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/090771429"},{"key":"ref11","first-page":"1","article-title":"A fast, adaptive variant of the Goemans-Williamson scheme for the prize-collecting Steiner tree problem","author":"hegde","year":"2014","journal-title":"Proceedings of the 11th DIMACS Implementation Challenge"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2016.7553022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0660-x"},{"key":"ref15","article-title":"Reduction techniques for the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem","author":"rehfeldt","year":"2016"},{"key":"ref16","first-page":"760","article-title":"The prize collecting Steiner tree problem: Theory and practice","author":"johnson","year":"2000","journal-title":"Proc SODA"},{"key":"ref17","first-page":"1","article-title":"On the implementation of MST-based heuristics for the Steiner problem in graphs","author":"de arag\u00e3o","year":"2002","journal-title":"Proc Workshop Algorithm Eng Exp"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170102"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581256"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90039-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2790639"},{"key":"ref27","first-page":"17","article-title":"A faster implementation of the Goemans&#x2013;Williamson clustering algorithm","author":"cole","year":"2001","journal-title":"Proc 12th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2525418"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2014.2314075"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2212452"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.250629"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317911"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2008.929286"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/978-0-387-30165-5_18","article-title":"Steiner tree problems in telecommunications","author":"vo\u00df","year":"2006","journal-title":"Handbook of Optimization in Telecommunications"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2599780"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-016-0111-0"},{"key":"ref22","year":"2018","journal-title":"DIMACS Implementation Challenges"},{"key":"ref21","year":"2018","journal-title":"StayNerd Solver for Steiner Trees and Related Problems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2017.0788"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806769"},{"key":"ref25","author":"feofiloff","year":"2010","journal-title":"A note on Johnson Minkoff and Phillips&#x2019; algorithm for the prize-collecting Steiner tree problem"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8642464\/08604004.pdf?arnumber=8604004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:49:48Z","timestamp":1657745388000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8604004\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":39,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2018.2888864","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}