On the approximability and hardness of minimum topic connected overlay and its special instances
dc.contributor.author
Hosoda, Jun
dc.contributor.author
Hromkovič, Juraj
dc.contributor.author
Izumi, Taisuke
dc.contributor.author
Ono, Hirotaka
dc.contributor.author
Steinová, Monika
dc.contributor.author
Wada, Koichi
dc.date.accessioned
2017-12-22T14:21:23Z
dc.date.available
2017-06-14T08:58:11Z
dc.date.available
2017-06-09T23:36:50Z
dc.date.available
2017-09-06T08:54:22Z
dc.date.available
2017-12-22T14:21:23Z
dc.date.issued
2012-04-20
dc.identifier.issn
0304-3975
dc.identifier.other
10.1016/j.tcs.2011.12.033
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/183204
dc.identifier.doi
10.3929/ethz-a-010889875
dc.format
application/pdf
dc.language.iso
en
en_US
dc.publisher
Elsevier
en_US
dc.rights.uri
http://rightsstatements.org/page/InC-NC/1.0/
dc.subject
Topic-connected overlay
en_US
dc.subject
Approximation algorithm
en_US
dc.subject
APX
en_US
dc.subject
Hardness
en_US
dc.title
On the approximability and hardness of minimum topic connected overlay and its special instances
en_US
dc.type
Journal Article
dc.rights.license
In Copyright - Non-Commercial Use Permitted
dc.date.published
2011-12-23
ethz.journal.title
Theoretical Computer Science
ethz.journal.volume
429
en_US
ethz.journal.abbreviated
Theor. comp. sci.
ethz.pages.start
144
en_US
ethz.pages.end
154
en_US
ethz.version.deposit
submittedVersion
en_US
ethz.code.ddc
DDC - DDC::0 - Computer science, information & general works::004 - Data processing, computer science
en_US
ethz.identifier.wos
ethz.publication.place
Amsterdam
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::09779 - Komm, Dennis / Komm, Dennis::03666 - Hromkovic, Juraj (emeritus) / Hromkovic, Juraj (emeritus)
en_US
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::09779 - Komm, Dennis / Komm, Dennis::03666 - Hromkovic, Juraj (emeritus) / Hromkovic, Juraj (emeritus)
ethz.relation.isReferencedBy
10.3929/ethz-a-010889883
ethz.date.deposited
2017-06-09T23:39:17Z
ethz.source
ECOL
ethz.source
ECIT
ethz.identifier.importid
imp59366bb13456d13483
ethz.identifier.importid
imp59364f2a92f3e23388
ethz.ecolpid
eth:50855
ethz.ecitpid
pub:79783
ethz.eth
yes
en_US
ethz.availability
Open access
en_US
ethz.rosetta.installDate
2017-09-06T08:46:50Z
ethz.rosetta.lastUpdated
2024-02-02T03:36:07Z
ethz.rosetta.versionExported
true
dc.identifier.olduri
http://hdl.handle.net/20.500.11850/48485
dc.identifier.olduri
http://hdl.handle.net/20.500.11850/156341
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=On%20the%20approximability%20and%20hardness%20of%20minimum%20topic%20connected%20overlay%20and%20its%20special%20instances&rft.jtitle=Theoretical%20Computer%20Science&rft.date=2012-04-20&rft.volume=429&rft.spage=144&rft.epage=154&rft.issn=0304-3975&rft.au=Hosoda,%20Jun&Hromkovi%C4%8D,%20Juraj&Izumi,%20Taisuke&Ono,%20Hirotaka&Steinov%C3%A1,%20Monika&rft.genre=article&rft_id=info:doi/10.1016/j.tcs.2011.12.033&
Files in this item
Publication type
-
Journal Article [130567]