Zur Kurzanzeige

dc.contributor.author
Erlebach, Thomas
dc.contributor.author
Hall, Alexander
dc.date.accessioned
2017-06-10T01:50:57Z
dc.date.available
2017-06-10T01:50:57Z
dc.date.issued
2004
dc.identifier.issn
1094-6136
dc.identifier.issn
1099-1425
dc.identifier.other
10.1023/B:JOSH.0000019682.75022.96
dc.identifier.uri
http://hdl.handle.net/20.500.11850/50601
dc.language.iso
en
dc.publisher
Springer
dc.subject
NP-complete
dc.subject
Broadcast scheduling
dc.subject
Resource augmentation
dc.subject
Approximation algorithm
dc.subject
Inapproximability
dc.title
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
dc.type
Conference Paper
ethz.journal.title
Journal of scheduling
ethz.journal.volume
7
ethz.journal.issue
3
ethz.journal.abbreviated
J. sched.
ethz.pages.start
223
ethz.pages.end
241
ethz.event
13th Annual ACM/SIAM Symposium on Discrete Algorithms
ethz.event.location
San Francisco, CA
ethz.event.date
january 06 - 08, 2002
ethz.identifier.wos
ethz.identifier.nebis
004117509
ethz.publication.place
Berlin
ethz.publication.status
published
ethz.date.deposited
2017-06-10T01:52:26Z
ethz.source
ECIT
ethz.identifier.importid
imp59364f568d82c68888
ethz.ecitpid
pub:82712
ethz.eth
yes
ethz.availability
Metadata only
ethz.rosetta.installDate
2017-07-14T12:03:46Z
ethz.rosetta.lastUpdated
2017-07-14T12:03:46Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=NP-hardness%20of%20broadcast%20scheduling%20and%20inapproximability%20of%20single-source%20unsplittable%20min-cost%20flow&rft.jtitle=Journal%20of%20scheduling&rft.date=2004&rft.volume=7&rft.issue=3&rft.spage=223&rft.epage=241&rft.issn=1094-6136&1099-1425&rft.au=Erlebach,%20Thomas&Hall,%20Alexander&rft.genre=proceeding&
 Suchen via SFX

Dateien zu diesem Eintrag

DateienGrößeFormatIm Viewer öffnen

Zu diesem Eintrag gibt es keine Dateien.

Publikationstyp

Zur Kurzanzeige