BibTeX record journals/corr/abs-2111-06299

download as .bib file

@article{DBLP:journals/corr/abs-2111-06299,
  author    = {Parinya Chalermsook and
               Matthias Kaul and
               Matthias Mnich and
               Joachim Spoerhase and
               Sumedha Uniyal and
               Daniel Vaz},
  title     = {Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial
               Diameter},
  journal   = {CoRR},
  volume    = {abs/2111.06299},
  year      = {2021},
  url       = {https://arxiv.org/abs/2111.06299},
  eprinttype = {arXiv},
  eprint    = {2111.06299},
  timestamp = {Tue, 16 Nov 2021 12:12:31 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2111-06299.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics