On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model

Bentert, Matthias; Schestag, Jannik; Sommer, Frank

doi:10.4230/LIPICS.IPEC.2023.4

by Matthias Bentert, Jannik Schestag, Frank Sommer

Reference:

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure ModelMatthias Bentert, Jannik Schestag, Frank Sommer18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 4:1–4:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Bibtex Entry:

@string{lipics="LIPIcs"}
@inproceedings{BentertSS23,
  author       = {Matthias Bentert and
                  Jannik Schestag and
                  Frank Sommer},
  editor       = {Neeldhara Misra and
                  Magnus Wahlstr{\"{o}}m},
  title        = {On the Complexity of Finding a Sparse Connected Spanning Subgraph
                  in a Non-Uniform Failure Model},
  booktitle    = {18th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
  series       = {LIPIcs},
  volume       = {285},
  pages        = {4:1--4:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2023.4},
  doi          = {10.4230/LIPICS.IPEC.2023.4}
}