A two-level graph partitioning problem arising in mobile wireless communications

Fairbrother, Jamie and Letchford, Adam Nicholas and Briggs, Keith (2018) A two-level graph partitioning problem arising in mobile wireless communications. Computational Optimization and Applications, 69 (3). pp. 653-676. ISSN 0926-6003

[img]
Preview
PDF (kpp-projection)
kpp_projection.pdf - Accepted Version
Available under License Creative Commons Attribution.

Download (342kB)

Abstract

In the k-partition problem (k-PP), one is given an edge-weighted undirected graph, and one must partition the node set into at most k subsets, in order to minimise (or maximise) the total weight of the edges that have their end-nodes in the same cluster. Various hierarchical variants of this problem have been studied in the context of data mining. We consider a 'two-level' variant that arises in mobile wireless communications. We show that an exact algorithm based on intelligent preprocessing, cutting planes and symmetry-breaking is capable of solving small- and medium-size instances to proven optimality, and providing strong lower bounds for larger instances.

Item Type: Journal Article
Journal or Publication Title: Computational Optimization and Applications
Additional Information: The final publication is available at Springer via http://dx.doi.org/10.1007/s10589-017-9967-9
Uncontrolled Keywords: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
Departments: Lancaster University Management School > Management Science
ID Code: 86449
Deposited By: ep_importer_pure
Deposited On: 25 May 2017 13:30
Refereed?: Yes
Published?: Published
Last Modified: 20 Feb 2020 03:16
URI: https://eprints.lancs.ac.uk/id/eprint/86449

Actions (login required)

View Item View Item