An Incremental Algorithm for (2-ε)-Approximate Steiner Tree Requiring O(n) Update Time

Hemraj Raikwar, Sushanta Karmakar. An Incremental Algorithm for (2-ε)-Approximate Steiner Tree Requiring O(n) Update Time. In Eleventh International Symposium on Computing and Networking, CANDAR 2023, Matsue, Japan, November 28 - Dec. 1, 2023. pages 168-174, IEEE, 2023. [doi]

@inproceedings{RaikwarK23,
  title = {An Incremental Algorithm for (2-ε)-Approximate Steiner Tree Requiring O(n) Update Time},
  author = {Hemraj Raikwar and Sushanta Karmakar},
  year = {2023},
  doi = {10.1109/CANDAR60563.2023.00030},
  url = {https://doi.org/10.1109/CANDAR60563.2023.00030},
  researchr = {https://researchr.org/publication/RaikwarK23},
  cites = {0},
  citedby = {0},
  pages = {168-174},
  booktitle = {Eleventh International Symposium on Computing and Networking, CANDAR 2023, Matsue, Japan, November 28 - Dec. 1, 2023},
  publisher = {IEEE},
  isbn = {979-8-3503-0670-5},
}