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

Vaz, Daniel

doi:10.22028/D291-32983

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

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;

External Resource

https://publikationen.sulb.uni-saarland.de/handle/20.500.11880/30394
(Any fulltext)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

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:10.22028/D291-32983.

Cite as: https://hdl.handle.net/21.11116/0000-0007-D8D7-3

Abstract

There is no abstract available