Go to the corresponding LIPIcs Volume Portal 
AbuAffash, A. Karim ; Carmi, Paz ; Maheshwari, Anil ; Morin, Pat ; Smid, Michiel ; Smorodinsky, Shakhar
pdfformat: 

@InProceedings{abuaffash_et_al:LIPIcs:2018:8715, author = {A. Karim AbuAffash and Paz Carmi and Anil Maheshwari and Pat Morin and Michiel Smid and Shakhar Smorodinsky}, title = {{Approximating Maximum DiameterBounded Subgraph in Unit Disk Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {2:12:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770668}, ISSN = {18688969}, year = {2018}, volume = {99}, editor = {Bettina Speckmann and Csaba D. T{\'o}th}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8715}, URN = {urn:nbn:de:0030drops87152}, doi = {10.4230/LIPIcs.SoCG.2018.2}, annote = {Keywords: Approximation algorithms, maximum diameterbounded subgraph, unit disk graphs, fractional Helly theorem, VCdimension} }
Keywords:  Approximation algorithms, maximum diameterbounded subgraph, unit disk graphs, fractional Helly theorem, VCdimension  
Seminar:  34th International Symposium on Computational Geometry (SoCG 2018)  
Issue Date:  2018  
Date of publication:  24.05.2018 