pdfformat: 

@InProceedings{feldmann_et_al:LIPIcs:2016:6803, author = {Andreas Emil Feldmann and Jochen K{\"o}nemann and Kanstantsin Pashkovich and Laura Sanit{\`a}}, title = {{Fast Approximation Algorithms for the Generalized Survivable Network Design Problem}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {33:133:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770262}, ISSN = {18688969}, year = {2016}, volume = {64}, editor = {SeokHee Hong}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6803}, URN = {urn:nbn:de:0030drops68035}, doi = {10.4230/LIPIcs.ISAAC.2016.33}, annote = {Keywords: strongly polynomial runtime, generalized survivable network design, primaldual method} }
Keywords:  strongly polynomial runtime, generalized survivable network design, primaldual method  
Seminar:  27th International Symposium on Algorithms and Computation (ISAAC 2016)  
Issue date:  2016  
Date of publication:  2016 