Constrained resource assignments: Fast algorithms and applications in wireless networks

A. Berger*, J. Gross, T. Harks, S. Tenbusch

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


Resource assignment problems occur in a vast variety of applications, from scheduling problems over image recognition to communication networks. Often these problems can be modeled by a maximum weight matching problem in (bipartite) graphs or generalizations thereof, and efficient and practical algorithms are known for these problems. Although in some of the applications an assignment of the resources may be needed only once, in many of these applications, the assignment has to be computed more often for different scenarios. In that case it is often essential that the assignments can be computed very fast. Moreover, implementing different assignments in different scenarios may come with a certain cost for the reconfiguration of the system. In this paper, we consider the problem of determining optimal assignments sequentially over a given time horizon, where consecutive assignments are coupled by constraints that control the cost of reconfiguration. We develop fast approximation and online algorithms for this problem with provable approximation guarantees and competitive ratios. Moreover, we present an extensive computational study about the applicability of our model and our algorithms in the context of orthogonal frequency division multiple access (OFDMA) wireless networks, finding a significant performance improvement for the total bandwidth of the system using our algorithms. For this application (the downlink of an OFDMA wireless cell) , the run time of matching algorithms is extremely important, having an acceptable range of a few milliseconds only. For the considered realistic instances, our algorithms perform extremely well: the solution quality is, on average, within a factor of 0.8–0.9 of optimal off-line solutions, and the running times are at most 5 ms per phase even in the worst case. Thus, our algorithms are well suited to be applied in the context of OFDMA systems.
Original languageEnglish
Pages (from-to)2070-2089
Number of pages20
JournalManagement Science
Issue number7
Early online date13 Nov 2015
Publication statusPublished - Jul 2016


  • mobile networks
  • frequency allocation
  • matchings
  • information systems
  • enabling technologies
  • analysis of algorithms
  • approximation algorithms


Dive into the research topics of 'Constrained resource assignments: Fast algorithms and applications in wireless networks'. Together they form a unique fingerprint.

Cite this