BibTeX record journals/scheduling/ErlebachH04

download as .bib file

@article{DBLP:journals/scheduling/ErlebachH04,
  author       = {Thomas Erlebach and
                  Alexander Hall},
  title        = {NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source
                  Unsplittable Min-Cost Flow},
  journal      = {J. Sched.},
  volume       = {7},
  number       = {3},
  pages        = {223--241},
  year         = {2004},
  url          = {https://doi.org/10.1023/B:JOSH.0000019682.75022.96},
  doi          = {10.1023/B:JOSH.0000019682.75022.96},
  timestamp    = {Wed, 01 Apr 2020 08:41:50 +0200},
  biburl       = {https://dblp.org/rec/journals/scheduling/ErlebachH04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.