Tight Approximability of the Server Allocation Problem for Real-Time Applications

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto, Taichi Shiitada. Tight Approximability of the Server Allocation Problem for Real-Time Applications. In Dan Alistarh, Alex Delis, George Pallis, editors, Algorithmic Aspects of Cloud Computing - Third International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers. Volume 10739 of Lecture Notes in Computer Science, pages 41-55, Springer, 2017. [doi]

@inproceedings{ItoKK0OS17,
  title = {Tight Approximability of the Server Allocation Problem for Real-Time Applications},
  author = {Takehiro Ito and Naonori Kakimura and Naoyuki Kamiyama and Yusuke Kobayashi 0001 and Yoshio Okamoto and Taichi Shiitada},
  year = {2017},
  doi = {10.1007/978-3-319-74875-7_4},
  url = {https://doi.org/10.1007/978-3-319-74875-7_4},
  researchr = {https://researchr.org/publication/ItoKK0OS17},
  cites = {0},
  citedby = {0},
  pages = {41-55},
  booktitle = {Algorithmic Aspects of Cloud Computing - Third International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers},
  editor = {Dan Alistarh and Alex Delis and George Pallis},
  volume = {10739},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-74875-7},
}