Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Chandra Chekuri, Kent Quanrud, and Manuel R. Torres. Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 24:1-24:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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-dev.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} }
Feedback for Dagstuhl Publishing