English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

MPS-Authors
/persons/resource/persons180826

Laekhanukit,  Bundit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons182530

Vaz,  Daniel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Chalermsook, P., Das, S., Even, G., Laekhanukit, B., & Vaz, D. (2018). Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. In E. Blais, K. Jansen, J. D. P. Rolim, & D. Steurer (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 1-19). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.APPROX-RANDOM.2018.8.


Cite as: http://hdl.handle.net/21.11116/0000-0002-A832-8
Abstract
There is no abstract available