Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. Ram Gaur, D., Ibaraki, T., & Krishnamurti, R. J. Algorithms (JAL), 43(1):138-152, 2002.
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem [link]Paper  bibtex   
@article{ dblp4303505,
  title = {Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem},
  author = {Daya Ram Gaur and Toshihide Ibaraki and Ramesh Krishnamurti},
  author_short = {Ram Gaur, D. and Ibaraki, T. and Krishnamurti, R.},
  bibtype = {article},
  type = {article},
  year = {2002},
  key = {dblp4303505},
  id = {dblp4303505},
  biburl = {http://www.dblp.org/rec/bibtex/journals/jal/GaurIK02},
  url = {http://dx.doi.org/10.1006/jagm.2002.1221},
  journal = {J. Algorithms (JAL)},
  pages = {138-152},
  number = {1},
  volume = {43},
  text = {J. Algorithms (JAL) 43(1):138-152 (2002)}
}

Downloads: 0