pdfformat: 

@InProceedings{chlamtc_et_al:LIPIcs:2014:4689, author = {Eden Chlamt{\'a}c and Michael Dinitz}, title = {{Lowest Degree kSpanner: Approximation and Hardness}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {8095}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897743}, ISSN = {18688969}, year = {2014}, volume = {28}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4689}, URN = {urn:nbn:de:0030drops46894}, doi = {10.4230/LIPIcs.APPROXRANDOM.2014.80}, annote = {Keywords: Graph spanners, approximation algorithms, hardness of approximation} }
Keywords:  Graph spanners, approximation algorithms, hardness of approximation  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)  
Issue date:  2014  
Date of publication:  04.09.2014 