Approximating the norms of graph spanners

Eden Chlamtáč, Michael Dinitz, Thomas Robinson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The ℓp-norm of the degree vector was recently introduced by [Chlamtáč, Dinitz, Robinson ICALP’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.

Original languageEnglish
Title of host publicationApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019
EditorsDimitris Achlioptas, Laszlo A. Vegh
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771252
DOIs
StatePublished - 1 Sep 2019
Event22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 23rd International Conference on Randomization and Computation, APPROX/RANDOM 2019 - Cambridge, United States
Duration: 20 Sep 201922 Sep 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume145
ISSN (Print)1868-8969

Conference

Conference22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 23rd International Conference on Randomization and Computation, APPROX/RANDOM 2019
Country/TerritoryUnited States
CityCambridge
Period20/09/1922/09/19

Keywords

  • Approximations
  • Spanners

Fingerprint

Dive into the research topics of 'Approximating the norms of graph spanners'. Together they form a unique fingerprint.

Cite this