Skip navigation
Skip navigation

The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks

Sun, Yahui; Brazil, Marcus; Thomas, Doreen; Halgamuge, Saman


It is challenging to design large and low-cost communication networks. In this paper, we formulate this challenge as the prize-collecting Steiner Tree Problem (PCSTP). The objective is to minimize the costs of transmission routes and the disconnected monetary or informational profits. Initially, we note that the PCSTP is MAX SNP-hard. Then, we propose some post-processing techniques to improve suboptimal solutions to PCSTP. Based on these techniques, we propose two fast heuristic algorithms:...[Show more]

CollectionsANU Research Publications
Date published: 2019-01-07
Type: Journal article
Source: IEEE Transactions on Networking
DOI: 10.1109/TNET.2018.2888864


File Description SizeFormat Image
08604004.pdf3.19 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator