Go to the corresponding LIPIcs Volume Portal 
Gairing, Martin ; Harks, Tobias ; Klimm, Max
pdfformat: 

@InProceedings{gairing_et_al:LIPIcs:2014:4699, author = {Martin Gairing and Tobias Harks and Max Klimm}, title = {{Complexity and Approximation of the Continuous Network Design Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {226241}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897743}, ISSN = {18688969}, year = {2014}, volume = {28}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4699}, URN = {urn:nbn:de:0030drops46998}, doi = {10.4230/LIPIcs.APPROXRANDOM.2014.226}, annote = {Keywords: Bilevel optimization, Optimization under equilibrium constraints, Network design, Wardrop equilibrium, Computational complexity, Approximation algorit} }
Keywords:  Bilevel optimization, Optimization under equilibrium constraints, Network design, Wardrop equilibrium, Computational complexity, Approximation algorit  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)  
Issue Date:  2014  
Date of publication:  02.09.2014 