The Computational Complexity of the Minimum Weight Processor Assignment Problem. Broersma, H., Paulusma, D., Smit, G. J. M., Vlaardingerbroek, F., & Woeginger, G. J. In Proceedings of WG, pages 189-200, 2004.
The Computational Complexity of the Minimum Weight Processor Assignment Problem [link]Paper  bibtex   
@inproceedings{ dblp2953360,
  title = {The Computational Complexity of the Minimum Weight Processor Assignment Problem},
  author = {Hajo Broersma and Daniël Paulusma and Gerard J. M. Smit and Frank Vlaardingerbroek and Gerhard J. Woeginger},
  author_short = {Broersma, H. and Paulusma, D. and Smit, G. J. M. and Vlaardingerbroek, F. and Woeginger, G. J.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2004},
  key = {dblp2953360},
  id = {dblp2953360},
  biburl = {http://www.dblp.org/rec/bibtex/conf/wg/BroersmaPSVW04},
  url = {http://dx.doi.org/10.1007/978-3-540-30559-0_16},
  conference = {WG},
  pages = {189-200},
  text = {WG 2004:189-200},
  booktitle = {Proceedings of WG}
}

Downloads: 0