Computational time complexity of allocation problem for distributed servers in real-time applications

Seydou Ba, Akio Kawabata, Bijoy Chand Chatterjee, Eiji Oki. Computational time complexity of allocation problem for distributed servers in real-time applications. In 18th Asia-Pacific Network Operations and Management Symposium, APNOMS 2016, Kanazawa, Japan, October 5-7, 2016. pages 1-4, IEEE, 2016. [doi]

@inproceedings{BaKCO16,
  title = {Computational time complexity of allocation problem for distributed servers in real-time applications},
  author = {Seydou Ba and Akio Kawabata and Bijoy Chand Chatterjee and Eiji Oki},
  year = {2016},
  doi = {10.1109/APNOMS.2016.7737236},
  url = {http://dx.doi.org/10.1109/APNOMS.2016.7737236},
  researchr = {https://researchr.org/publication/BaKCO16},
  cites = {0},
  citedby = {0},
  pages = {1-4},
  booktitle = {18th Asia-Pacific Network Operations and Management Symposium, APNOMS 2016, Kanazawa, Japan, October 5-7, 2016},
  publisher = {IEEE},
  isbn = {978-4-88552-304-5},
}