Go to the corresponding LIPIcs Volume Portal |
pdf-format: |
|
@InProceedings{biniaz:LIPIcs.ISAAC.2021.7, author = {Biniaz, Ahmad}, title = {{Approximating Longest Spanning Tree with Neighborhoods}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {7:1--7:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15440}, URN = {urn:nbn:de:0030-drops-154401}, doi = {10.4230/LIPIcs.ISAAC.2021.7}, annote = {Keywords: Euclidean maximum spanning tree, spanning tree with neighborhoods, approximation algorithms} }
Keywords: | Euclidean maximum spanning tree, spanning tree with neighborhoods, approximation algorithms | |
Collection: | 32nd International Symposium on Algorithms and Computation (ISAAC 2021) | |
Issue Date: | 2021 | |
Date of publication: | 30.11.2021 |