On the approximability and hardness of minimum topic connected overlay and its special instances
Permanent link
https://doi.org/10.3929/ethz-a-010889875Publication status
publishedExternal links
Journal / series
Theoretical Computer ScienceVolume
Pages / Article No.
Publisher
ElsevierSubject
Topic-connected overlay; Approximation algorithm; APX; HardnessOrganisational unit
02150 - Dep. Informatik / Dep. of Computer Science03666 - Hromkovic, Juraj (emeritus) / Hromkovic, Juraj (emeritus)
Related publications and datasets
Is referenced by: https://doi.org/10.3929/ethz-a-010889883
More
Show all metadata
ETH Bibliography
yes
Altmetrics