Document Open Access Logo

Vertex Sparsifiers for Hyperedge Connectivity

Authors Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang

PDF
Thumbnail PDF

File

LIPIcs.ESA.2022.70.pdf
  • Filesize: 0.85 MB
  • 13 pages

Document Identifiers

Author Details

Han Jiang
  • University of Michigan, Ann Arbor, MI, USA
Shang-En Huang
  • University of Michigan, Ann Arbor, MI, USA
Thatchaphol Saranurak
  • University of Michigan, Ann Arbor, MI, USA
Tian Zhang
  • University of Michigan, Ann Arbor, MI, USA

Acknowledgements

We thank Sorrachai Yingchareonthawornchai, Yang Liu, Yunbum Kook, and Richard Peng for the discussion that inspires the notion of the pruned auxiliary graph in this paper. We also thank anonymous reviewers for their valuable comments.

Cite AsGet BibTex

Han Jiang, Shang-En Huang, Thatchaphol Saranurak, and Tian Zhang. Vertex Sparsifiers for Hyperedge Connectivity. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 70:1-70:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.ESA.2022.70

Abstract

Recently, Chalermsook et al. {[}SODA'21{]} introduces a notion of vertex sparsifiers for c-edge connectivity, which has found applications in parameterized algorithms for network design and also led to exciting dynamic algorithms for c-edge st-connectivity {[}Jin and Sun FOCS'22{]}. We study a natural extension called vertex sparsifiers for c-hyperedge connectivity and construct a sparsifier whose size matches the state-of-the-art for normal graphs. More specifically, we show that, given a hypergraph G = (V,E) with n vertices and m hyperedges with k terminal vertices and a parameter c, there exists a hypergraph H containing only O(kc³) hyperedges that preserves all minimum cuts (up to value c) between all subset of terminals. This matches the best bound of O(kc³) edges for normal graphs by [Liu'20]. Moreover, H can be constructed in almost-linear O(p^{1+o(1)} + n(rclog n)^{O(rc)}log m) time where r = max_{e ∈ E}|e| is the rank of G and p = ∑_{e ∈ E}|e| is the total size of G, or in poly(m, n) time if we slightly relax the size to O(kc³log^{1.5}(kc)) hyperedges.

Subject Classification

ACM Subject Classification
  • Theory of computation → Sparsification and spanners
Keywords
  • Vertex sparsifier
  • hypergraph
  • connectivity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81-100, 1993. Google Scholar
  2. Nikhil Bansal, Ola Svensson, and Luca Trevisan. New notions and constructions of sparsification for graphs and hypergraphs. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 910-928. IEEE, 2019. Google Scholar
  3. András A Benczúr and David R Karger. Randomized approximation schemes for cuts and flows in capacitated graphs. SIAM Journal on Computing, 44(2):290-319, 2015. Google Scholar
  4. Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P Liu, Richard Peng, Mark Sellke, and Daniel Vaz. Vertex sparsification for edge connectivity. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1206-1225. SIAM, 2021. Google Scholar
  5. Chandra Chekuri and Chao Xu. Minimum cuts and sparsification in hypergraphs. SIAM Journal on Computing, 47(6):2118-2156, 2018. Google Scholar
  6. Yu Chen, Sanjeev Khanna, and Ansh Nagda. Near-linear size hypergraph cut sparsifiers. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 61-72. IEEE, 2020. Google Scholar
  7. David Eppstein, Zvi Galil, Giuseppe F Italiano, and Amnon Nissenzweig. Sparsification—a technique for speeding up dynamic graph algorithms. Journal of the ACM (JACM), 44(5):669-696, 1997. Google Scholar
  8. Jacob Holm, Kristian De Lichtenberg, and Mikkel Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM (JACM), 48(4):723-760, 2001. Google Scholar
  9. Wenyu Jin and Xiaorui Sun. Fully dynamic st edge connectivity in subpolynomial time. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 861-872. IEEE, 2022. Google Scholar
  10. Michael Kapralov, Robert Krauthgamer, Jakab Tardos, and Yuichi Yoshida. Towards tight bounds for spectral sparsification of hypergraphs. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 598-611, 2021. Google Scholar
  11. Michael Kapralov, Robert Krauthgamer, Jakab Tardos, and Yuichi Yoshida. Spectral hypergraph sparsifiers of nearly linear size. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 1159-1170. IEEE, 2022. Google Scholar
  12. Arindam Khan and Prasad Raghavendra. On mimicking networks representing minimum terminal cuts. Information Processing Letters, 114(7):365-371, 2014. Google Scholar
  13. Dmitry Kogan and Robert Krauthgamer. Sketching cuts in graphs and hypergraphs. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pages 367-376, 2015. Google Scholar
  14. Stefan Kratsch and Magnus Wahlström. Representative sets and irrelevant vertices: New tools for kernelization. J. ACM, 67(3):16:1-16:50, 2020. URL: https://doi.org/10.1145/3390887.
  15. Robert Krauthgamer and Inbal Rika. Mimicking networks and succinct representations of terminal cuts. In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pages 1789-1799. SIAM, 2013. Google Scholar
  16. Yang P. Liu. Vertex sparsification for edge connectivity in polynomial time. CoRR, abs/2011.15101, 2020. URL: http://arxiv.org/abs/2011.15101.
  17. Daniel Lokshtanov, Saket Saurabh, and Vaishali Surianarayanan. A parameterized approximation scheme for min k-cut. In Sandy Irani, editor, 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS, 2020. Google Scholar
  18. Yaowei Long and Thatchaphol Saranurak. Near-optimal deterministic vertex-failure connectivity oracles. CoRR, abs/2205.03930, 2022. Google Scholar
  19. Hiroshi Nagamochi and Toshihide Ibaraki. A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph. Algorithmica, 7(1):583-596, 1992. Google Scholar
  20. Richard Peng, Bryce Sandlund, and Daniel D Sleator. Optimal offline dynamic 2, 3-edge/vertex connectivity. In Workshop on Algorithms and Data Structures, pages 553-565. Springer, 2019. Google Scholar
  21. Tasuku Soma and Yuichi Yoshida. Spectral sparsification of hypergraphs. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2570-2581. SIAM, 2019. Google Scholar
  22. Daniel A Spielman and Shang-Hua Teng. Spectral sparsification of graphs. SIAM Journal on Computing, 40(4):981-1025, 2011. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact