English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Thesis

Approximation Algorithms for Network Design and Cut Problems in Bounded-Treewidth

MPS-Authors
/persons/resource/persons182530

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

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

Vaz, D. (2020). Approximation Algorithms for Network Design and Cut Problems in Bounded-Treewidth. PhD Thesis, Universität des Saarlandes, Saarbrücken. doi:http://dx.doi.org/10.22028/D291-32983.


Cite as: http://hdl.handle.net/21.11116/0000-0007-D8D7-3
Abstract
There is no abstract available