Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Directed Buy-at-Bulk Spanners (2404.05172v2)

Published 8 Apr 2024 in cs.DS

Abstract: We present a framework that unifies directed buy-at-bulk network design and directed spanner problems, namely, buy-at-bulk spanners. The goal is to find a minimum-cost routing solution for network design problems that capture economies at scale, while satisfying demands and distance constraints for terminal pairs. A more restricted version of this problem was shown to be $O(2{{\log{1-\varepsilon} n}})$-hard to approximate, where $n$ is the number of vertices, under a standard complexity assumption, due to Elkin and Peleg (Theory of Computing Systems, 2007). To the best of our knowledge, our results are the first sublinear factor approximation algorithms for directed buy-at-bulk spanners. Furthermore, these results hold even when we allow the edge lengths to be negative, unlike the previous literature for spanners. Our approximation ratios match the state-of-the-art ratios in special cases, namely, buy-at-bulk network design by Antonakopoulos (WAOA, 2010) and weighted spanners by Grigorescu, Kumar, and Lin (APPROX 2023). Our results are based on new approximation algorithms for the following two problems that are of independent interest: minimum-density distance-constrained junction trees and resource-constrained shortest path with negative consumption.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (52)
  1. Reachability preservers: New extremal bounds and approximation algorithms. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (2018), SIAM, pp. 1865–1883.
  2. Graph spanners: A tutorial review. Computer Science Review 37 (2020), 100253.
  3. The online set cover problem. SIAM J. Comput. 39, 2 (2009), 361–370.
  4. Andrews, M. Hardness of buy-at-bulk network design. In 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2004), IEEE, pp. 115–124.
  5. Antonakopoulos, S. Buy-at-bulk-related problems in network design. PhD thesis, Columbia University, 2009.
  6. Awerbuch, B. Communication-time trade-offs in network synchronization. In Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing (New York, NY, USA, 1985), PODC ’85, Association for Computing Machinery, p. 272–276.
  7. Buy-at-bulk network design. In Proceedings 38th Annual Symposium on Foundations of Computer Science (FOCS) (1997), IEEE, pp. 542–547.
  8. Faster algorithms for all-pairs approximate shortest paths in undirected graphs. SIAM J. Comput. 39, 7 (2010), 2865–2896.
  9. Approximation algorithms for spanner problems and directed steiner forest. Information and Computation 222 (2013), 93–107.
  10. Transitive-closure spanners. SIAM Journal on Computing 41, 6 (2012), 1380–1425.
  11. Better distance preservers and additive spanners. In SODA (2016), R. Krauthgamer, Ed., SIAM, pp. 855–872.
  12. Online buy-at-bulk network design. SIAM J. Comput. 47, 4 (2018), 1505–1528.
  13. Approximation algorithms for directed steiner problems. Journal of Algorithms 33, 1 (1999), 73–91.
  14. On non-uniform multicommodity buy-at-bulk network design. In Proceedings of the 37th Annual ACM Symposium on Theory of computing (STOC) (2005), pp. 176–182.
  15. Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Transactions on Algorithms (TALG) 7, 2 (2011), 1–17.
  16. Approximation algorithms for node-weighted buy-at-bulk network design. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2007), pp. 1265–1274.
  17. Approximation algorithms for nonuniform buy-at-bulk network design. SIAM Journal on Computing 39, 5 (2010), 1772–1798.
  18. Approximating spanners and directed steiner forest: Upper and lower bounds. ACM Transactions on Algorithms (TALG) 16, 3 (2020), 1–31.
  19. On the approximability of some network design problems. ACM Transactions on Algorithms (TALG) 4, 2 (2008), 1–17.
  20. Compact roundtrip routing in directed networks. J. Algorithms 50, 1 (2004), 79–95.
  21. Directed spanners via flow-based linear programs. In STOC (2011), pp. 323–332.
  22. Approximating low-stretch spanners. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms (2016), SIAM, pp. 821–840.
  23. Design networks with bounded pairwise distance. In Proceedings of the thirty-first annual ACM symposium on Theory of computing (1999), pp. 750–759.
  24. All-pairs almost shortest paths. SIAM J. Comput. 29, 5 (2000), 1740–1759.
  25. Elkin, M. Computing almost shortest paths. ACM Trans. Algorithms 1, 2 (2005), 283–323.
  26. The client-server 2-spanner problem with applications to network design. In SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001 (2001), F. Comellas, J. Fàbrega, and P. Fraigniaud, Eds., vol. 8 of Proceedings in Informatics, Carleton Scientific, pp. 117–132.
  27. The hardness of approximating spanner problems. Theory Comput. Syst. 41, 4 (2007), 691–729.
  28. Improved approximation algorithms for directed steiner forest. Journal of Computer and System Sciences 78, 1 (2012), 279–292.
  29. Simple cost sharing schemes for multicommodity rent-or-buy and stochastic steiner tree. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing (2006), pp. 663–670.
  30. Approximation algorithms for directed weighted spanners, 2023.
  31. Online directed spanners and steiner forests. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021) (2021), Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
  32. A constant factor approximation for the single sink edge installation problem. SIAM Journal on Computing 38, 6 (2009), 2426–2442.
  33. Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. (2003), IEEE, pp. 606–615.
  34. Simpler and better approximation algorithms for network design. In Proceedings of the 35th Annual ACM Symposium on Theory of computing (STOC) (2003), pp. 365–372.
  35. Last but not least: Online spanners for buy-at-bulk. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (2017), SIAM, pp. 589–599.
  36. Near-optimal online algorithms for prize-collecting steiner problems. In Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I 41 (2014), Springer, pp. 576–587.
  37. Online node-weighted steiner forest and extensions via disk paintings. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) (2013), IEEE, pp. 558–567.
  38. Hassin, R. Approximation schemes for the restricted shortest path problem. Mathematics of Operations research 17, 1 (1992), 36–42.
  39. An improved approximation scheme for the group steiner problem. Networks: An International Journal 37, 1 (2001), 8–20.
  40. Multi-criteria approximation schemes for the resource constrained shortest path problem. Optimization Letters 12, 3 (2018), 475–483.
  41. A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms 1, 19 (1995), 104–115.
  42. Kortsarz, G. On the hardness of approximating spanners. Algorithmica 30 (2001), 432–450.
  43. A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters 28, 5 (2001), 213–219.
  44. Cost-distance: Two metric network design. SIAM Journal on Computing 38, 4 (2008), 1648–1659.
  45. Online node-weighted steiner tree and related problems. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) (2011), IEEE, pp. 210–219.
  46. Approximating cycles in directed graphs: Fast algorithms for girth and roundtrip spanners. In SODA (2018), A. Czumaj, Ed., SIAM, pp. 1374–1392.
  47. Graph spanners. Journal of Graph Theory 13, 1 (1989), 99–116.
  48. An optimal synchronizer for the hypercube. SIAM J. Comput. 18, 4 (1989), 740–747.
  49. Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms 4, 3 (2008), 29:1–29:17.
  50. Approximating the single-sink link-installation problem in network design. SIAM Journal on Optimization 11, 3 (2001), 595–610.
  51. Online covering with lqsubscript𝑙𝑞l_{q}italic_l start_POSTSUBSCRIPT italic_q end_POSTSUBSCRIPT-norm objectives and applications to network design. Mathematical Programming 184 (2020).
  52. Talwar, K. The single-sink buy-at-bulk lp has constant integrality gap. In International Conference on Integer Programming and Combinatorial Optimization (IPCO) (2002), Springer, pp. 475–486.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now