Fast Approximation Algorithms for the Generalized Survivable Network Design Problem

DOI10.4230/LIPIcs.ISAAC.2016.33zbMath1398.68673arXiv1604.07049MaRDI QIDQ4636516

Kanstantsin Pashkovich, Jochen Könemann, Laura Sanità, Andreas Emil Feldmann

Publication date: 19 April 2018

Full work available at URL: https://arxiv.org/abs/1604.07049

zbMATH Keywords

primal-dual methodgeneralized survivable network designstrongly polynomial runtime

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Unnamed Item

This page was built for publication: Fast Approximation Algorithms for the Generalized Survivable Network Design Problem