Published in: OASIcs, Volume 65, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
Christoph Hansknecht, Alexander Richter, and Sebastian Stiller. Fast Robust Shortest Path Computations. In 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018). Open Access Series in Informatics (OASIcs), Volume 65, pp. 5:1-5:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{hansknecht_et_al:OASIcs.ATMOS.2018.5, author = {Hansknecht, Christoph and Richter, Alexander and Stiller, Sebastian}, title = {{Fast Robust Shortest Path Computations}}, booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)}, pages = {5:1--5:21}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-096-5}, ISSN = {2190-6807}, year = {2018}, volume = {65}, editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.5}, URN = {urn:nbn:de:0030-drops-97100}, doi = {10.4230/OASIcs.ATMOS.2018.5}, annote = {Keywords: Graph Algorithms, Shortest Paths, Robust Optimization} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Christoph Hansknecht, Max Klimm, and Alexander Skopalik. Approximate Pure Nash Equilibria in Weighted Congestion Games. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 242-257, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{hansknecht_et_al:LIPIcs.APPROX-RANDOM.2014.242, author = {Hansknecht, Christoph and Klimm, Max and Skopalik, Alexander}, title = {{Approximate Pure Nash Equilibria in Weighted Congestion Games}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {242--257}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.242}, URN = {urn:nbn:de:0030-drops-47005}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.242}, annote = {Keywords: Congestion game, Pure Nash equilibrium, Approximate equilibrium, Existence, Potential function} }
Feedback for Dagstuhl Publishing