On the approximability and hardness of minimum topic connected overlay and its special instances

Download
Full text (submitted Version) (Adobe PDF, 321.2Kb)
Thumbnail
Open access
Author
Hosoda, Jun
Hromkovič, Juraj
Izumi, Taisuke
Ono, Hirotaka
Steinová, Monika
Wada, Koichi
Show all
Date
2012-04-20
Type
  • Journal Article
Rights / license
In Copyright - Non-Commercial Use Permitted
Permanent link
https://doi.org/10.3929/ethz-a-010889875
Publication status
published
External links
Search via SFX
Journal / series
Theoretical Computer Science
Volume
429
Pages / Article No.
144 - 154
Publisher
Elsevier
Subject
Topic-connected overlay; Approximation algorithm; APX; Hardness
Organisational unit
02150 - Departement Informatik / Department of Computer Science
03666 - Hromkovic, Juraj  
Related publications and datasets
More
Show all metadata
Citations
Cited 4 times in Web of Science
Cited 5 times in Scopus
ETH Bibliography
yes
Altmetrics