An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
IBM Journal of Research and Development
IEEE Transactions on Parallel and Distributed Systems
3G Evolution, Second Edition: HSPA and LTE for Mobile Broadband
3G Evolution, Second Edition: HSPA and LTE for Mobile Broadband
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Performance analysis of dynamic OFDMA systems with inband signaling
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In communication networks, resource assignment problems appear in several different settings. These problems are often modeled by a maximum weight matching problem in bipartite graphs and efficient matching algorithms are well known. In several applications, the corresponding matching problem has to be solved many times in a row as the underlying system operates in a time-slotted fashion and the edge weights change over time. However, changing the assignments can come with a certain cost for reconfiguration that depends on the number of changed edges between subsequent assignments. In order to control the cost of reconfiguration, we propose the k-constrained bipartite matching problem for bipartite graphs, which seeks an optimal matching that realizes at most k changes from a previous matching. We provide fast approximation algorithms with provable guarantees for this problem. Furthermore, to cope with the sequential nature of assignment problems, we introduce an online variant of the k- constrained matching problem and derive online algorithms that are based on our approximation algorithms for the k-constrained bipartite matching problem. Finally, we establish the applicability of our model and our algorithms in the context of OFDMA wireless networks finding a significant performance improvement for the proposed algorithms.