Logarithmic inapproximability of the radio broadcast problem

Michael Elkin; Guy Kortsarz

doi:10.1016/j.jalgor.2003.11.004

Logarithmic inapproximability of the radio broadcast problem

Michael Elkin, Guy Kortsarz

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

We show that the radio broadcast problem is Ω(log n)-inapproximable unless NP ⊆ BPTIME(n O(log log n)). This is the first result on the hardness of approximation of this problem. Our reduction is based on the reduction from the Label-Cover problem to the Set Cover problem due to Lund and Yannakakis [LY94], and uses some new ideas.

Original language	English GB
Pages (from-to)	8-25
Number of pages	18
Journal	Journal of Algorithms
Volume	52
Issue number	1
DOIs	https://doi.org/10.1016/j.jalgor.2003.11.004
State	Published - 2004

Access to Document

10.1016/j.jalgor.2003.11.004

https://doi.org/10.1016/j.jalgor.2003.11.004

Cite this

@article{44dd305a82c64221aa9c48ffbe2c0886,

title = "Logarithmic inapproximability of the radio broadcast problem",

abstract = "We show that the radio broadcast problem is Ω(log n)-inapproximable unless NP ⊆ BPTIME(n O(log log n)). This is the first result on the hardness of approximation of this problem. Our reduction is based on the reduction from the Label-Cover problem to the Set Cover problem due to Lund and Yannakakis [LY94], and uses some new ideas.",

author = "Michael Elkin and Guy Kortsarz",

year = "2004",

doi = "10.1016/j.jalgor.2003.11.004",

language = "אנגלית",

volume = "52",

pages = "8--25",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Logarithmic inapproximability of the radio broadcast problem

AU - Elkin, Michael

AU - Kortsarz, Guy

PY - 2004

Y1 - 2004

N2 - We show that the radio broadcast problem is Ω(log n)-inapproximable unless NP ⊆ BPTIME(n O(log log n)). This is the first result on the hardness of approximation of this problem. Our reduction is based on the reduction from the Label-Cover problem to the Set Cover problem due to Lund and Yannakakis [LY94], and uses some new ideas.

AB - We show that the radio broadcast problem is Ω(log n)-inapproximable unless NP ⊆ BPTIME(n O(log log n)). This is the first result on the hardness of approximation of this problem. Our reduction is based on the reduction from the Label-Cover problem to the Set Cover problem due to Lund and Yannakakis [LY94], and uses some new ideas.

U2 - 10.1016/j.jalgor.2003.11.004

DO - 10.1016/j.jalgor.2003.11.004

M3 - מאמר

SN - 0196-6774

VL - 52

SP - 8

EP - 25

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 1

ER -

Logarithmic inapproximability of the radio broadcast problem

Abstract

Access to Document

Fingerprint

Cite this