2026-08-03T04:36:38Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4689 2024-03-06T10:35:14Z ddc:004 open_access

Lowest Degree k-Spanner: Approximation and Hardness Chlamtác, Eden Dinitz, Michael Graph spanners approximation algorithms hardness of approximation A k-spanner is a subgraph in which distances are approximately preserved, up to some given stretch factor k. We focus on the following problem: Given a graph and a value k, can we find a k-spanner that minimizes the maximum degree? While reasonably strong bounds are known for some spanner problems, they almost all involve minimizing the total number of edges. Switching the objective to the degree introduces significant new challenges, and currently the only known approximation bound is an O~(Delta^(3-2*sqrt(2)))-approximation for the special case when k = 2 [Chlamtac, Dinitz, Krauthgamer FOCS 2012] (where Delta is the maximum degree in the input graph). In this paper we give the first non-trivial algorithm and polynomial-factor hardness of approximation for the case of general k. Specifically, we give an LP-based O~(Delta^((1-1/k)^2) )-approximation and prove that it is hard to approximate the optimum to within Delta^Omega(1/k) when the graph is undirected, and to within Delta^Omega(1) when it is directed. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Eden Chlamtác and Michael Dinitz 2014 Is Part Of LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.APPROX-RANDOM.2014.80 urn:nbn:de:0030-drops-46894 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.80 eng https://creativecommons.org/licenses/by/3.0/legalcode