@InProceedings{chekuri_et_al:LIPIcs.APPROX/RANDOM.2021.24,
author = {Chekuri, Chandra and Quanrud, Kent and Torres, Manuel R.},
title = {{Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)},
pages = {24:1--24:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-207-5},
ISSN = {1868-8969},
year = {2021},
volume = {207},
editor = {Wootters, Mary and Sanit\`{a}, Laura},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.24},
URN = {urn:nbn:de:0030-drops-147177},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.24},
annote = {Keywords: bounded degree spanning tree, crossing spanning tree, swap rounding, fast approximation algorithms}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode