19 lines
669 B
BibTeX
19 lines
669 B
BibTeX
|
|
@article{chalermsook_approximating_2024,
|
|
title = {Approximating {Sparsest} {Cut} in {Low}-{Treewidth} {Graphs} via {Combinatorial} {Diameter}},
|
|
volume = {20},
|
|
issn = {1549-6325, 1549-6333},
|
|
url = {http://arxiv.org/abs/2111.06299},
|
|
doi = {10.1145/3632623},
|
|
number = {1},
|
|
urldate = {2025-05-07},
|
|
journal = {ACM Transactions on Algorithms},
|
|
author = {Chalermsook, Parinya and Kaul, Matthias and Mnich, Matthias and Spoerhase, Joachim and Uniyal, Sumedha and Vaz, Daniel},
|
|
month = jan,
|
|
year = {2024},
|
|
note = {arXiv:2111.06299 [cs]},
|
|
keywords = {Computer Science - Data Structures and Algorithms},
|
|
pages = {1--20},
|
|
annote = {Comment: 15 pages, 3 figures},
|
|
}
|