David Eppstein. A Stronger Lower Bound on Parametric Minimum Spanning Trees. In Anna Lubiw, Mohammad R. Salavatipour, editors, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings. Volume 12808 of Lecture Notes in Computer Science, pages 343-356, Springer, 2021. [doi]
@inproceedings{Eppstein21-0, title = {A Stronger Lower Bound on Parametric Minimum Spanning Trees}, author = {David Eppstein}, year = {2021}, doi = {10.1007/978-3-030-83508-8_25}, url = {https://doi.org/10.1007/978-3-030-83508-8_25}, researchr = {https://researchr.org/publication/Eppstein21-0}, cites = {0}, citedby = {0}, pages = {343-356}, booktitle = {Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings}, editor = {Anna Lubiw and Mohammad R. Salavatipour}, volume = {12808}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-030-83508-8}, }