Abstract
It was recently found that there are very close connections between the existence of additive spanners (subgraphs where all distances are preserved up to an additive stretch), distance preservers (subgraphs in which demand pairs have their distance preserved exactly), and pairwise spanners (subgraphs in which demand pairs have their distance preserved up to a multiplicative or additive stretch) [Abboud-Bodwin SODA’16 8 J.ACM’17, Bodwin-Williams SODA’16]. We study these problems from an optimization point of view, where rather than studying the existence of extremal instances, we are given an instance and are asked to find the sparsest possible spanner/preserver. We give an O(n3/5 + ε)-approximation for distance preservers and pairwise spanners (for arbitrary constant ε > 0). This is the first nontrivial upper bound for either problem, both of which are known to be as hard to approximate as Label Cover. We also prove Label Cover hardness for approximating additive spanners, even for the cases of additive 1 stretch (where one might expect a polylogarithmic approximation, since the related multiplicative 2-spanner problem admits an O(log n)-approximation) and additive polylogarithmic stretch (where the related multiplicative spanner problem has an O(1)-approximation).
Interestingly, the techniques we use in our approximation algorithm extend beyond distance-based problem to pure connectivity network design problems. In particular, our techniques allow us to give an O(n3/5 + ε)-approximation for the Directed Steiner Forest problem (for arbitrary constant ε > 0) when all edges have uniform costs, improving the previous best O(n2/3 + ε)-approximation due to Berman et al. [ICALP’11] (which holds for general edge costs).
- Amir Abboud and Greg Bodwin. 2017. The 4/3 additive spanner exponent is tight. J. ACM 64, 4, Article 28 (Sept. 2017), 20 pages. DOI:https://doi.org/10.1145/3088511Google ScholarDigital Library
- Amir Abboud, Greg Bodwin, and Seth Pettie. 2017. A hierarchy of lower bounds for sublinear additive spanners. In Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms (SODA’17). Society for Industrial and Applied Mathematics, Philadelphia, PA, 568--576. Retrieved from http://dl.acm.org/citation.cfm?id=3039686.3039722.Google ScholarDigital Library
- Donald Aingworth, Chandra Chekuri, Piotr Indyk, and Rajeev Motwani. 1999. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28, 4 (1999), 1167--1181. DOI:https://doi.org/10.1137/S0097539796303421Google ScholarDigital Library
- Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. 1993. On sparse spanners of weighted graphs. Discrete Comput. Geom. 9, 1 (1993), 81--100. DOI:https://doi.org/10.1007/BF02189308Google ScholarCross Ref
- Sanjeev Arora and Carsten Lund. 1997. Approximation algorithms for NP-hard problems. In Approximation Algorithms for NP-hard Problems, Dorit S. Hochbaum (Ed.). PWS Publishing Co., Boston, MA, Chapter: “Hardness of Approximations,” 399--446. Retrieved from http://dl.acm.org/citation.cfm?id=241938.241948.Google Scholar
- Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie. 2010. Additive spanners and (α,β)-spanners. ACM Trans. Algor. 7, 1, Article 5 (Dec. 2010), 26 pages. DOI:https://doi.org/10.1145/1868237.1868242Google Scholar
- Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, and Grigory Yaroslavtsev. 2013. Approximation algorithms for spanner problems and directed Steiner forest. Inf. Comput. 222 (2013), 93--107. DOI:https://doi.org/10.1016/j.ic.2012.10.007Google ScholarDigital Library
- Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, and David P. Woodruff. 2009. Transitive-closure spanners. In Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA’09). Society for Industrial and Applied Mathematics, Philadelphia, PA, 932--941. Retrieved from http://dl.acm.org/citation.cfm?id=1496770.1496871.Google Scholar
- Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, and Guido Proietti. 2015. Improved purely additive fault-tolerant spanners. In Algorithms—ESA 2015, Nikhil Bansal and Irene Finocchi (Eds.). Springer Berlin, 167--178.Google ScholarCross Ref
- Greg Bodwin, Michael Dinitz, Merav Parter, and Virginia Vassilevska Williams. 2018. Optimal vertex fault tolerant spanners (for fixed stretch). In Proceedings of the 29th ACM-SIAM Symposium on Discrete Algorithms (SODA’18). Society for Industrial and Applied Mathematics, Philadelphia, PA, 1884--1900. Retrieved from http://dl.acm.org/citation.cfm?id=3174304.3175428.Google ScholarCross Ref
- Greg Bodwin and Shyamal Patel. 2019. A trivial yet optimal solution to vertex fault tolerant spanners. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC’19). ACM, New York, NY, 541--543. DOI:https://doi.org/10.1145/3293611.3331588Google ScholarDigital Library
- Greg Bodwin and Virginia Vassilevska Williams. 2016. Better distance preservers and additive spanners. In Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA’16). Society for Industrial and Applied Mathematics, Philadelphia, PA, 855--872. Retrieved from http://dl.acm.org/citation.cfm?id=2884435.2884496.Google ScholarDigital Library
- Shiri Chechik. 2013. New additive spanners. In Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA’13). Society for Industrial and Applied Mathematics, Philadelphia, PA, 498--512. Retrieved from http://dl.acm.org/citation.cfm?id=2627817.2627853.Google ScholarCross Ref
- Shiri Chechik. 2016. Additive Spanners. Springer New York, New York, NY, 22--24. DOI:https://doi.org/10.1007/978-1-4939-2864-4_562Google Scholar
- Chandra Chekuri, Guy Even, Anupam Gupta, and Danny Segev. 2011. Set connectivity problems in undirected graphs and the directed Steiner network problem. ACM Trans. Algor. 7, 2, Article 18 (March 2011), 17 pages. DOI:https://doi.org/10.1145/1921659.1921664Google Scholar
- C. Chekuri, M. T. Hajiaghayi, G. Kortsarz, and M. R. Salavatipour. 2010. Approximation algorithms for nonuniform buy-at-bulk network design. SIAM J. Comput. 39, 5 (2010), 1772--1798. DOI:https://doi.org/10.1137/090750317Google ScholarDigital Library
- Eden Chlamtác and Michael Dinitz. 2014. Lowest degree k-spanner: Approximation and hardness. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014) (Leibniz International Proceedings in Informatics (LIPIcs)), Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, and Cristopher Moore (Eds.), Vol. 28. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 80--95. DOI:https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.80Google Scholar
- Eden Chlamtac, Michael Dinitz, and Robert Krauthgamer. 2012. Everywhere-sparse spanners via dense subgraphs. In Proceedings of the IEEE 53rd Symposium on Foundations of Computer Science (FOCS’12). IEEE Computer Society, Washington, DC, 758--767. DOI:https://doi.org/10.1109/FOCS.2012.61Google ScholarDigital Library
- Eden Chlamtáč, Michael Dinitz, Guy Kortsarz, and Bundit Laekhanukit. 2017. Approximating spanners and directed Steiner forest: Upper and lower bounds. In Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms (SODA’17). Society for Industrial and Applied Mathematics, Philadelphia, PA, 534--553. Retrieved from http://dl.acm.org/citation.cfm?id=3039686.3039720.Google ScholarCross Ref
- Don Coppersmith and Michael Elkin. 2006. Sparse sourcewise and pairwise distance preservers. SIAM J. Discrete Math. 20, 2 (2006), 463--501. DOI:https://doi.org/10.1137/050630696Google ScholarDigital Library
- Michael Dinitz, Guy Kortsarz, and Ran Raz. 2015. Label cover instances with large girth and the hardness of approximating basic k-spanner. ACM Trans. Algor. 12, 2, Article 25 (Dec. 2015), 16 pages. DOI:https://doi.org/10.1145/2818375Google Scholar
- Michael Dinitz and Robert Krauthgamer. 2011. Directed spanners via flow-based linear programs. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC’11). ACM, New York, NY, 323--332. DOI:https://doi.org/10.1145/1993636.1993680Google ScholarDigital Library
- Michael Dinitz and Robert Krauthgamer. 2011. Fault-tolerant spanners: Better and simpler. In Proceedings of the 30th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’11). ACM, New York, NY, 169--178. DOI:https://doi.org/10.1145/1993806.1993830Google ScholarDigital Library
- Michael Dinitz and Zeyu Zhang. 2016. Approximating low-stretch spanners. In Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA’16). Society for Industrial and Applied Mathematics, Philadelphia, PA, 821--840. Retrieved from http://dl.acm.org/citation.cfm?id=2884435.2884494.Google ScholarCross Ref
- Michael Elkin and David Peleg. 2007. The hardness of approximating spanner problems. Theor. Comp. Sys. 41, 4 (Dec. 2007), 691--729. DOI:https://doi.org/10.1007/s00224-006-1266-2Google Scholar
- Paul Erdös. 1964. Extremal Problems in Graph Theory. Academia Praha, Czechoslovakia, 29--36.Google Scholar
- Moran Feldman, Guy Kortsarz, and Zeev Nutov. 2012. Improved approximation algorithms for directed Steiner forest. J. Comput. Syst. Sci. 78, 1 (2012), 279--292. DOI:https://doi.org/10.1016/j.jcss.2011.05.009Google ScholarDigital Library
- Naveen Garg, Goran Konjevod, and R. Ravi. 2000. A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37, 1 (2000), 66--84. DOI:https://doi.org/10.1006/jagm.2000.1096Google ScholarDigital Library
- Christopher S. Helvig, Gabriel Robins, and Alexander Zelikovsky. 2001. An improved approximation scheme for the group Steiner problem. Networks 37, 1 (2001), 8--20. DOI:https://doi.org/10.1002/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-RGoogle ScholarCross Ref
- Guy Kortsarz. 2001. On the hardness of approximating spanners. Algorithmica 30, 3 (2001), 432--450.Google ScholarCross Ref
- G. Kortsarz and D. Peleg. 1994. Generating sparse 2-spanners. J. Algorithms 17, 2 (1994), 222--236. DOI:https://doi.org/10.1006/jagm.1994.1032Google ScholarDigital Library
- David P. Woodruff. 2006. Lower bounds for additive spanners, emulators, and more. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS’06). IEEE Computer Society, Washington, DC, 389--398. DOI:https://doi.org/10.1109/FOCS.2006.45Google ScholarDigital Library
- David P. Woodruff. 2010. Additive spanners in nearly quadratic time. In Proceedings of the 37th International Colloquium Conference on Automata, Languages and Programming (ICALP’10). Springer-Verlag, 463--474. Retrieved from http://dl.acm.org/citation.cfm?id=1880918.1880970.Google ScholarDigital Library
- Alexander Zelikovsky. 1997. A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica 18, 1 (1997), 99--110. DOI:https://doi.org/10.1007/BF02523690Google ScholarDigital Library
Index Terms
- Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
Recommendations
Approximating spanners and directed steiner forest: upper and lower bounds
SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete AlgorithmsIt was recently found that there are very close connections between the existence of additive spanners (subgraphs where all distances are preserved up to an additive stretch), distance preservers (subgraphs in which demand pairs have their distance ...
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
In the directed Steiner tree (DST) problem, we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes. Our goal is to find a minimum-cost subgraph that contains a directed path from $r$ to every terminal. We ...
Transitive-Closure Spanners
† Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009)Given a directed graph $G = (V,E)$ and an integer $k \geq 1$, a $k$-transitive-closure-spanner ($k$-TC-spanner) of $G$ is a directed graph $H = (V, E_H)$ that has (1) the same transitive-closure as $G$ and (2) diameter at most $k$. These spanners were ...
Comments