Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Algorithms Year : 2024

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter

Parinya Chalermsook
Joachim Spoerhase
Sumedha Uniyal
Fichier principal
Vignette du fichier
main-revision2.pdf (748.79 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-04445475 , version 1 (18-02-2024)

Identifiers

Cite

Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, et al.. Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Transactions on Algorithms, 2024, 20 (1), pp.1 - 20. ⟨10.1145/3632623⟩. ⟨hal-04445475⟩
15 View
13 Download

Altmetric

Share

Gmail Facebook X LinkedIn More