pdf-format: |
|
@InProceedings{chlamtc_et_al:LIPIcs:2014:4689, author = {Eden Chlamt{\'a}c and Michael Dinitz}, title = {{Lowest Degree k-Spanner: Approximation and Hardness}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {80--95}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4689}, URN = {urn:nbn:de:0030-drops-46894}, doi = {10.4230/LIPIcs.APPROX-RANDOM.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 |