@InProceedings{bandyapadhyay_et_al:LIPIcs.MFCS.2018.37,
author = {Bandyapadhyay, Sayan and Maheshwari, Anil and Mehrabi, Saeed and Suri, Subhash},
title = {{Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames}},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
pages = {37:1--37:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-086-6},
ISSN = {1868-8969},
year = {2018},
volume = {117},
editor = {Potapov, Igor and Spirakis, Paul and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.37},
URN = {urn:nbn:de:0030-drops-96198},
doi = {10.4230/LIPIcs.MFCS.2018.37},
annote = {Keywords: Minimum dominating set, Rectangles and L-frames, Approximation schemes, Local search, APX-hardness}
}