This paper addresses the problem of beamforming (BF) design for orthogonal frequency division multiplexing (OFDM) based relay networks over frequency-selective channels. Both freq...
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Ar...
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...