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

Download
Full text (submitted Version) (PDF, 321.2Kb)
Thumbnail
Open access
Autor(in)
Hosoda, Jun
Hromkovič, Juraj
Izumi, Taisuke
Ono, Hirotaka
Steinová, Monika
Wada, Koichi
Alle anzeigen
Datum
2012-04-20
Typ
    Journal Article
Rechte / Lizenz
In Copyright - Non-Commercial Use Permitted
Persistenter Link
https://doi.org/10.3929/ethz-a-010889875
Publikationsstatus
published
Externe Links
Zeitschrift / Serie
Theoretical Computer Science
Band
429
Seiten / Artikelnummer
144 - 154
Verlag
Elsevier
Thema
Topic-connected overlay; Approximation algorithm; APX; Hardness
Organisationseinheit
02150 - Dep. Informatik / Dep. of Computer Science
03666 - Hromkovic, Juraj (emeritus) / Hromkovic, Juraj (emeritus)  
Zugehörige Publikationen und Daten
Mehr
Alle Metadaten anzeigen
ETH Bibliographie
yes
Altmetrics