Research Article
Hypergraph Modeling and Approximation Algorithms for the Minimum Length Link Scheduling in Multiuser MIMO Networks
Procedure : if is -colorable, return a independent link set of | size ; otherwise, an arbitrary subset of size . | Input: An integer and a hypergraph . | Output: A subset of with the size . | (1) ; ; | (2) ; | (3) Partition into sets where and ; | (4) for to | (5) for each subset of of size | (6) if is independent in | (7) return ; | (8) endif | (9) endfor | (10) endfor | (11) return an arbitrary subset of of size ; |
|