Skip to main content
Help
Log In
Log in with TUHH Account
Log in with ORCID
Email address
Password
Login for Externals
New user? Click here to register.
Have you forgotten your password?
English
Deutsch
Communities & Collections
Publications
Research Data
People
Institutions
Projects
Statistics
Home
TUHH
Publications
Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
Export
Statistics
Options
Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
Citation Link:
https://doi.org/10.15480/882.4142
Basic Data Publication
Publikationstyp
Preprint
Date Issued
2021
Sprache
English
Author(s)
Chalermsook, Parinya
Kaul, Matthias
Mnich, Matthias
Spoerhase, Joachim
Uniyal, Sumedha
Vaz, Daniel
Institut
Algorithmen und Komplexität E-11
DOI
10.15480/882.4142
TORE-URI
http://hdl.handle.net/11420/10926
Publisher Version
Citation
arXiv: 2111.06299 (2021)
Publisher Link
10.48550/arXiv.2111.06299
ArXiv ID
2111.06299
Content
DDC Class
510: Mathematik
Funding References
Funding Organisations
European Research Council
Academy of Finland Research Fellowship
Alexander von Humboldt-Stiftung
Files
Lizenz
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Loading...
Loading...
Download
Name
2111.06299.pdf
Size
616.1 KB
Format
Adobe PDF
