@InProceedings{abuaffash_et_al:LIPIcs.SoCG.2018.2,
author = {Abu-Affash, A. Karim and Carmi, Paz and Maheshwari, Anil and Morin, Pat and Smid, Michiel and Smorodinsky, Shakhar},
title = {{Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs}},
booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)},
pages = {2:1--2:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-066-8},
ISSN = {1868-8969},
year = {2018},
volume = {99},
editor = {Speckmann, Bettina and T\'{o}th, Csaba D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.2},
URN = {urn:nbn:de:0030-drops-87152},
doi = {10.4230/LIPIcs.SoCG.2018.2},
annote = {Keywords: Approximation algorithms, maximum diameter-bounded subgraph, unit disk graphs, fractional Helly theorem, VC-dimension}
}