A 2-approximation for the bounded treewidth sparsest cut problem in FPT time
| Author: | Vincent Cohen-Addad, Tobias MömkeORCiDGND, Victor Verdugo |
|---|---|
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/108426 |
| ISBN: | 978-3-031-06900-0OPAC |
| ISBN: | 978-3-031-06901-7OPAC |
| ISSN: | 0302-9743OPAC |
| ISSN: | 1611-3349OPAC |
| Parent Title (English): | Lecture Notes in Computer Science |
| Publisher: | Springer |
| Place of publication: | Cham |
| Type: | Article |
| Language: | English |
| Year of first Publication: | 2022 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2023/10/17 |
| Volume: | 13265 |
| First Page: | 112 |
| Last Page: | 125 |
| Note: | Published in: Integer Programming and Combinatorial Optimization: 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings, edited by Karen Aardal, Laura Sanità |
| DOI: | https://doi.org/10.1007/978-3-031-06901-7_9 |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Theoretische Informatik / Resource Aware Algorithmics |
