Ivan Hu, Dieter van Melkebeek, Andrew Morgan. Query Complexity of Inversion Minimization on Trees. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 2836-2866, SIAM, 2023. [doi]
@inproceedings{HuMM23-0,
title = {Query Complexity of Inversion Minimization on Trees},
author = {Ivan Hu and Dieter van Melkebeek and Andrew Morgan},
year = {2023},
doi = {10.1137/1.9781611977554.ch107},
url = {https://doi.org/10.1137/1.9781611977554.ch107},
researchr = {https://researchr.org/publication/HuMM23-0},
cites = {0},
citedby = {0},
pages = {2836-2866},
booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023},
editor = {Nikhil Bansal 0001 and Viswanath Nagarajan},
publisher = {SIAM},
isbn = {978-1-61197-755-4},
}