@inproceedings{a31f0d5e181d4832b01633bc6d2209ef,
title = "Approximating the norms of graph spanners",
abstract = "The ℓp-norm of the degree vector was recently introduced by [Chlamt{\'a}{\v c}, Dinitz, Robinson ICALP{\textquoteright}19] as a new cost metric for graph spanners, as it interpolates between two traditional notions of cost (the sparsity ℓ1 and the max degree ℓ∞) and is well-motivated from applications. We study this from an approximation algorithms point of view, analyzing old algorithms and designing new algorithms for this new context, as well as providing hardness results. Our main results are for the ℓ2-norm and stretch 3, where we give a tight analysis of the greedy algorithm and a new algorithm specifically tailored to this setting which gives an improved approximation ratio.",
keywords = "Approximations, Spanners",
author = "Eden Chlamt{\'a}{\v c} and Michael Dinitz and Thomas Robinson",
note = "Publisher Copyright: {\textcopyright} Eden Chlamt{\'a}{\v c}, Michael Dinitz, and Thomas Robinson.; 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 23rd International Conference on Randomization and Computation, APPROX/RANDOM 2019 ; Conference date: 20-09-2019 Through 22-09-2019",
year = "2019",
month = sep,
day = "1",
doi = "10.4230/LIPIcs.APPROX-RANDOM.2019.11",
language = "American English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Dimitris Achlioptas and Vegh, \{Laszlo A.\}",
booktitle = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019",
address = "Germany",
}