{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article7727","name":"Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation","abstract":"We consider a network design problem called the generalized terminal backup problem. Whereas earlier work investigated the edge-connectivity constraints only, we consider both edge- and node-connectivity constraints for this problem. A major contribution of this paper is \r\nthe development of a strongly polynomial-time 4\/3-approximation algorithm for the problem. Specifically, we show that a linear programming relaxation of the problem is half-integral, and that the half-integral optimal solution can be rounded to a 4\/3-approximate solution. We also prove that the linear programming relaxation of the problem with the edge-connectivity constraints is equivalent to minimizing the cost of half-integral multiflows that satisfy flow demands given from terminals. This observation implies a strongly polynomial-time algorithm for computing a minimum cost half-integral multiflow under flow demand constraints.","keywords":["survivable network design","multiflow","LP rounding"],"author":{"@type":"Person","name":"Fukunaga, Takuro","givenName":"Takuro","familyName":"Fukunaga"},"position":28,"pageStart":316,"pageEnd":328,"dateCreated":"2015-02-26","datePublished":"2015-02-26","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Fukunaga, Takuro","givenName":"Takuro","familyName":"Fukunaga"},"copyrightYear":"2015","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2015.316","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6233","volumeNumber":30,"name":"32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)","dateCreated":"2015-02-26","datePublished":"2015-02-26","editor":[{"@type":"Person","name":"Mayr, Ernst W.","givenName":"Ernst W.","familyName":"Mayr"},{"@type":"Person","name":"Ollinger, Nicolas","givenName":"Nicolas","familyName":"Ollinger"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article7727","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6233"}}}