Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo. A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. In Karen Aardal, Laura Sanità, editors, Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings. Volume 13265 of Lecture Notes in Computer Science, pages 112-125, Springer, 2022. [doi]
@inproceedings{Cohen-AddadMV22,
title = {A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time},
author = {Vincent Cohen-Addad and Tobias Mömke and Victor Verdugo},
year = {2022},
doi = {10.1007/978-3-031-06901-7_9},
url = {https://doi.org/10.1007/978-3-031-06901-7_9},
researchr = {https://researchr.org/publication/Cohen-AddadMV22},
cites = {0},
citedby = {0},
pages = {112-125},
booktitle = {Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings},
editor = {Karen Aardal and Laura Sanità},
volume = {13265},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-031-06901-7},
}