@inproceedings{e5f5d1290a5f48ab97b777f2c11f6417,
title = "Approximation bound for semidefinite relaxation based multicast transmit beamforming",
abstract = "The max-min-fair transmit beamforming problem in multigroup broadcasting has been shown to be NP-hard in general. Recently, a polynomial time approximation approach based on semidefinite relaxation (SDR) has been proposed [1]. It was found [1]. through computer simulations, that this method is capable of giving a good approximate solution in polynomial time. This paper shows that the SDR based approach can guarantee as least an ο(1/M) approximation quality, where M is the total number of receivers. The existence of such a data independent bound certifies the worst case approximation quality of the SDR algorithm for any problem instance and any number of transmit antennas.",
keywords = "Approximation bound, Broadcasting, Semidefinite relaxation, Transmit beamforming",
author = "Chang, {Tsung Hui} and Zhi-Quan Luo and Chi, {Chong Yung}",
year = "2007",
month = dec,
day = "1",
doi = "10.1109/CAMSAP.2007.4497998",
language = "English (US)",
isbn = "9781424417148",
series = "2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP",
pages = "193--196",
booktitle = "2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP",
note = "2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMPSAP ; Conference date: 12-12-2007 Through 14-12-2007",
}