Bounding the Running Time of Algorithms for Scheduling and Packing Problems

Klaus Jansen, Felix Land, Kati Land. Bounding the Running Time of Algorithms for Scheduling and Packing Problems. SIAM J. Discrete Math., 30(1):343-366, 2016. [doi]

@article{JansenLL16,
  title = {Bounding the Running Time of Algorithms for Scheduling and Packing Problems},
  author = {Klaus Jansen and Felix Land and Kati Land},
  year = {2016},
  doi = {10.1137/140952636},
  url = {http://dx.doi.org/10.1137/140952636},
  researchr = {https://researchr.org/publication/JansenLL16},
  cites = {0},
  citedby = {0},
  journal = {SIAM J. Discrete Math.},
  volume = {30},
  number = {1},
  pages = {343-366},
}