Approximate minimum tree cover in all symmetric monotone norms simultaneously

Kaul, Matthias, Luo, Kelin, Mnich, Matthias, Röglin, Heiko

Open source

DOI
10.15480/882.14837
Published
2025
Container
Not recorded
Publisher
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
Open access
yes

Credibility signals

limited evidence Score 47/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.15480/882.14837,
  title = {Approximate minimum tree cover in all symmetric monotone norms simultaneously},
  author = {Kaul, Matthias and Luo, Kelin and Mnich, Matthias and Röglin, Heiko},
  year = {2025},
  doi = {10.15480/882.14837},
  url = {https://doi.org/10.15480/882.14837}
}

RIS

TY  - JOUR
TI  - Approximate minimum tree cover in all symmetric monotone norms simultaneously
AU  - Kaul, Matthias
AU  - Luo, Kelin
AU  - Mnich, Matthias
AU  - Röglin, Heiko
PY  - 2025
DO  - 10.15480/882.14837
UR  - https://doi.org/10.15480/882.14837
ER  - 

APA

Matthias, K., Kelin, L., Matthias, M., & Heiko, R. (2025). Approximate minimum tree cover in all symmetric monotone norms simultaneously. https://doi.org/10.15480/882.14837

Source records