Go to the corresponding LIPIcs Volume Portal 
Bansal, Ishan ; Cheriyan, Joe ; Grout, Logan ; Ibrahimpur, Sharat
pdfformat: 

@InProceedings{bansal_et_al:LIPIcs.APPROX/RANDOM.2023.14, author = {Bansal, Ishan and Cheriyan, Joe and Grout, Logan and Ibrahimpur, Sharat}, title = {{Algorithms for 2Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {14:114:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772969}, ISSN = {18688969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18839}, URN = {urn:nbn:de:0030drops188396}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.14}, annote = {Keywords: Approximation algorithms, Capacitated network design, Network design, Parametrized algorithms, Steiner cycle problem, Steiner 2edge connected subgraphs, Steiner 2node connected subgraphs} }
Keywords:  Approximation algorithms, Capacitated network design, Network design, Parametrized algorithms, Steiner cycle problem, Steiner 2edge connected subgraphs, Steiner 2node connected subgraphs  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)  
Issue Date:  2023  
Date of publication:  04.09.2023 