Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach

by Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li

Published in ACM-SIAM Symposium on Discrete Algorithms by Society for Industrial and Applied Mathematics

Page(s)	55-71
Release Date	2013-12-18
Container Type	conference-series
Publisher	Society for Industrial and Applied Mathematics

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)

Type chapter
Stage

published

Date 2013-12-18

DOI 10.1137/1.9781611973402.5
dblp conf/soda/BansalCKL14

Container Metadata
Not in DOAJ
Not in ISSN ROAD
Not in Keepers Registry
Fatcat Entry

Work Entity
grouping other versions (eg, pre-print) and variants of this release

Cite This Release

BibTeX
CSL-JSON
MLA
Harvard

Lookup Links

Fatcat Bits

Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach release_kk4rysulyve77gdpfdvkk6tmuq