Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals

Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur. Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals. In Nicole Megow, Adam Smith, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA. Volume 275 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

@inproceedings{BansalCGI23-0,
  title = {Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals},
  author = {Ishan Bansal and Joe Cheriyan and Logan Grout and Sharat Ibrahimpur},
  year = {2023},
  doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.14},
  url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.14},
  researchr = {https://researchr.org/publication/BansalCGI23-0},
  cites = {0},
  citedby = {0},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA},
  editor = {Nicole Megow and Adam Smith},
  volume = {275},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-296-9},
}