Online Directed Spanners and Steiner Forests

We present online algorithms for directed spanners and directed Steiner forests. These are well-studied network connectivity problems that fall under the unifying framework of online covering and packing linear programming formulations. This framework was developed in the seminal work of Buchbinder and Naor (Mathematics of Operations Research, 34, 2009) and is based on primal-dual techniques. Specifically, our results include the following: • For the pairwise spanner problem, in which the pairs of vertices to be spanned arrive online, we present an efficient randomized algorithm with competitive ratio Õ(n) for graphs with general lengths, where n is the number of vertices of the given graph. For graphs with uniform lengths, we give an efficient randomized algorithm with competitive ratio Õ(n), and an efficient deterministic algorithm with competitive ratio Õ(k), where k is the number of terminal pairs. To the best of our knowledge, these are the first online algorithms for directed spanners. In the offline version, the current best approximation ratio for uniform edge lengths is Õ(n), due to Chlamtáč, Dinitz, Kortsarz, and Laekhanukit (TALG 2020). • For the directed Steiner forest problem with uniform costs, in which the pairs of vertices to be connected arrive online, we present an efficient randomized algorithm with competitive ratio Õ(n). The state-of-the-art online algorithm for general costs is due to Chakrabarty, Ene, Krishnaswamy, and Panigrahi (SICOMP 2018) and is Õ(k)competitive. In the offline version, the current best approximation ratio with uniform costs is Õ(n), due to Chlamtáč, Dinitz, Kortsarz, and Laekhanukit (TALG 2020). To obtain efficient and competitive online algorithms, we observe that a small modification of the online covering and packing framework by Buchbinder and Naor implies a polynomialtime implementation of the primal-dual approach with separation oracles, which a priori might perform exponentially many calls to the oracle. We convert the online spanner problem into an online covering problem and complete the rounding-step analysis in a problem-specific fashion. Purdue University, Email: {elena-g, lin532, krq}@purdue.edu E.G and Y.L. were supported in part by NSF CCF-1910659 and NSF CCF-1910411.

[1]  Jochen Könemann,et al.  From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem , 2005, ICALP.

[2]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[3]  Mohammad Taghi Hajiaghayi,et al.  Euclidean Prize-Collecting Steiner Forest , 2011, Algorithmica.

[4]  Xiangkun Shen,et al.  Online covering with $$\ell _q$$ℓq-norm objectives and applications to network design , 2020, Math. Program..

[5]  Arnold Filtser,et al.  Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model , 2020, SODA.

[6]  Tim Roughgarden,et al.  Optimal Efficiency Guarantees for Network Design Mechanisms , 2007, IPCO.

[7]  Tim Roughgarden,et al.  Optimal Cost-Sharing Mechanisms for Steiner Forest Problems , 2006, WINE.

[8]  Stephen G. Kobourov,et al.  Graph Spanners: A Tutorial Review , 2020, Comput. Sci. Rev..

[9]  Michael Dinitz,et al.  Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds , 2017, SODA.

[10]  Kyomin Jung,et al.  Transitive-Closure Spanners , 2008, SIAM J. Comput..

[11]  Guy Kortsarz.  On the Hardness of Approximating Spanners , 2001, Algorithmica.

[12]  David P. Woodruff,et al.  Spanners and sparsifiers in dynamic streams , 2014, PODC.

[13]  Mikkel Thorup,et al.  Roundtrip spanners and roundtrip routing in directed graphs , 2002, SODA '02.

[14]  Baruch Awerbuch,et al.  Communication-time trade-offs in network synchronization , 1985, PODC '85.

[15]  David Peleg,et al.  The Hardness of Approximating Spanner Problems , 2000, STACS.

[16]  Philip N. Klein,et al.  A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[17]  Jochen Könemann,et al.  A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game , 2008, SIAM J. Comput..

[18]  Joseph Naor,et al.  Randomized competitive algorithms for generalized caching , 2008, STOC.

[19]  Virginia Vassilevska Williams,et al.  Better Distance Preservers and Additive Spanners , 2015, SODA.

[20]  Yossi Azar,et al.  On-line generalized Steiner problem , 1996, SODA '96.

[21]  Bilel Derbel,et al.  On the locality of distributed sparse spanner construction , 2008, PODC '08.

[22]  Yossi Azar,et al.  Online Algorithms for Covering and Packing Problems with Convex Objectives , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[23]  Spyridon Antonakopoulos.  Approximating Directed Buy-at-Bulk Network Design , 2010, WAOA.

[24]  Sofya Raskhodnikova,et al.  Testing Lipschitz Functions on Hypergrid Domains , 2012, Algorithmica.

[25]  Michael Dinitz,et al.  Directed spanners via flow-based linear programs , 2011, STOC '11.

[26]  Jakub W. Pachocki,et al.  Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners , 2016, SODA.

[27]  Joseph S. B. Mitchell,et al.  Bicriteria Shortest Path Problems in the Plane ( extended abstract ) , 2022 .

[28]  Joseph Naor,et al.  A primal-dual randomized algorithm for weighted paging , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[29]  R. Ravi,et al.  LAST but not Least: Online Spanners for Buy-at-Bulk , 2016, SODA.

[30]  Andrew Chi-Chih Yao,et al.  Space-time tradeoff for answering range queries (Extended Abstract) , 1982, STOC '82.

[31]  Jose Augusto Ramos Soares,et al.  Graph Spanners: a Survey , 1992 .

[32]  Guy Kortsarz,et al.  Improved approximating algorithms for Directed Steiner Forest , 2009, SODA.

[33]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[34]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.

[35]  Alex Zelikovsky,et al.  A series of approximation algorithms for the acyclic directed steiner tree problem , 1997, Algorithmica.

[36]  Yossi Azar,et al.  Online Mixed Packing and Covering , 2012, SODA.

[37]  Neal Young,et al.  The K-Server Dual and Loose Competitiveness for Paging , 1991, On-Line Algorithms.

[38]  Telikepalli Kavitha,et al.  Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs , 2010, SIAM J. Comput..

[39]  Uri Zwick,et al.  All-Pairs Almost Shortest Paths , 1997, SIAM J. Comput..

[40]  Piotr Berman,et al.  Approximation algorithms for spanner problems and Directed Steiner Forest , 2013, Inf. Comput..

[41]  Ernest Fraenkel,et al.  Revealing disease-associated pathways by network integration of untargeted metabolomics , 2016, Nature Methods.

[42]  Debmalya Panigrahi,et al.  Online Buy-at-Bulk Network Design , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[43]  Mihai Patrascu,et al.  Distance Oracles beyond the Thorup-Zwick Bound , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[44]  Bonnie Berger,et al.  Genome-Scale Networks Link Neurodegenerative Disease Genes to α-Synuclein through Specific Molecular Pathways. , 2017, Cell systems.

[45]  Danny Raz,et al.  A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..

[46]  Michael Dinitz,et al.  Approximating Low-Stretch Spanners , 2016, SODA.

[47]  Bilel Derbel,et al.  Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time , 2007, DISC.

[48]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[49]  Anupam Gupta,et al.  Set connectivity problems in undirected graphs and the directed Steiner network problem , 2008, SODA '08.

[50]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Covering and Packing , 2009, Math. Oper. Res..

[51]  Shiri Chechik,et al.  Approximate Distance Oracles with Improved Bounds , 2015, STOC.

[52]  Noga Alon,et al.  The online set cover problem , 2003, STOC '03.

[53]  Anupam Gupta,et al.  Approximating Sparse Covering Integer Programs Online , 2012, Math. Oper. Res..

[54]  Surender Baswana,et al.  Streaming algorithm for graph spanners - single pass and constant processing time per edge , 2008, Inf. Process. Lett..

[55]  Tim Roughgarden,et al.  Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[56]  David Peleg,et al.  An optimal synchronizer for the hypercube , 1987, PODC '87.

[57]  Michael Elkin,et al.  Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners , 2007, TALG.

[58]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[59]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

[60]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[61]  Jochen Könemann,et al.  Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree , 2006, STOC '06.

[62]  Michael Elkin,et al.  Computing almost shortest paths , 2001, TALG.

[63]  Alex Zelikovsky,et al.  An improved approximation scheme for the Group Steiner Problem , 2001, Networks.

[64]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[65]  Noga Alon,et al.  A general approach to online network optimization problems , 2004, SODA '04.

[66]  Anna R. Karlin,et al.  Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.

[67]  David Peleg,et al.  The Client-Server 2-Spanner Problem with Applications to Network Design , 2001, SIROCCO.

[68]  Joseph Naor,et al.  Improved bounds for online routing and packing via a primal-dual approach , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[69]  Piotr Berman,et al.  On-line algorithms for Steiner tree problems (extended abstract) , 1997, STOC '97.

[70]  Lenore Cowen,et al.  Compact roundtrip routing in directed networks , 2004, J. Algorithms.