On the Hardness of Range Assignment Problems

Bernhard Fuchs. On the Hardness of Range Assignment Problems. In Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano, editors, Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings. Volume 3998 of Lecture Notes in Computer Science, pages 127-138, Springer, 2006. [doi]

@inproceedings{Fuchs06,
  title = {On the Hardness of Range Assignment Problems},
  author = {Bernhard Fuchs},
  year = {2006},
  doi = {10.1007/11758471_15},
  url = {http://dx.doi.org/10.1007/11758471_15},
  researchr = {https://researchr.org/publication/Fuchs06},
  cites = {0},
  citedby = {0},
  pages = {127-138},
  booktitle = {Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings},
  editor = {Tiziana Calamoneri and Irene Finocchi and Giuseppe F. Italiano},
  volume = {3998},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-34375-X},
}