English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Approximation Algorithms for Network Design and Cut Problems in Bounded-Treewidth

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Vaz, Daniel1, 2, Author              
Mehlhorn, Kurt1, Advisor              
Chalermsook, Parinya1, Referee              
Krauthgamer, Robert3, Referee
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_1116551              
3External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2020-12-0820202020
 Publication Status: Published in print
 Pages: 175 p.
 Publishing info: Saarbrücken : Universität des Saarlandes
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.22028/D291-32983
BibTex Citekey: Vaz_2020
 Degree: PhD

Event

show

Legal Case

show

Project information

show

Source

show