User Allocation in Multi-System, Multi-Service Scenarios: Upper and Lower Performance Bound of Polynomial Time Assignment Algorithms

Ingmar Blau, Gerhard Wunder. User Allocation in Multi-System, Multi-Service Scenarios: Upper and Lower Performance Bound of Polynomial Time Assignment Algorithms. In Proceedings of the 41st Annual Conference on Information Sciences and Systems, CISS 2007, 14-16 March 2007, Johns Hopkins University, Department of Electrical Engineering, Baltimore, MD, USA. pages 41-46, IEEE, 2007. [doi]

@inproceedings{BlauW07,
  title = {User Allocation in Multi-System, Multi-Service Scenarios: Upper and Lower Performance Bound of Polynomial Time Assignment Algorithms},
  author = {Ingmar Blau and Gerhard Wunder},
  year = {2007},
  doi = {10.1109/CISS.2007.4298270},
  url = {http://dx.doi.org/10.1109/CISS.2007.4298270},
  researchr = {https://researchr.org/publication/BlauW07},
  cites = {0},
  citedby = {0},
  pages = {41-46},
  booktitle = {Proceedings of the 41st Annual Conference on Information Sciences and Systems, CISS 2007, 14-16 March 2007, Johns Hopkins University, Department of Electrical Engineering,  Baltimore, MD, USA},
  publisher = {IEEE},
}