| Page(s) | 55-71 |
| Release Date | 2013-12-18 |
| Publisher | Society for Industrial and Applied Mathematics |
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
release_kk4rysulyve77gdpfdvkk6tmuq
by
Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li
Published
in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
by Society for Industrial and Applied Mathematics
Known Files and URLs
application/pdf 476.8 kB
sha1:af0996bf1213d28cd50b...
|
ttic.uchicago.edu:80 (web) web.archive.org (webarchive) |
application/pdf 476.8 kB
sha1:9a60b0b57df5ff537e58...
|
web.archive.org (webarchive) web.archive.org (webarchive) www.win.tue.nl (web) web.archive.org (webarchive) www.cs.cmu.edu:80 (web) |
Read Full Text
Type
Stage
Date 2013-12-18
chapterStage
published
Date 2013-12-18
Work Entity
grouping other versions (eg, pre-print) and variants of this release
grouping other versions (eg, pre-print) and variants of this release
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Fatcat Bits
State is "active".
Revision:
0c5e50af-e036-4177-aaab-63551e81c78c
As JSON object via API