Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more
Published in SODA, 2024
We propose an algorithm finding a solution for the Steiner point removal problem in minor-free graph
Recommended citation: HC Chang, J Conroy, H Le, L Milenkovic, S Solomon, C Than. (2024). "Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more ." ACM-SIAM Symposium on Discrete Algorithms (SODA24).