License:
Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-77101
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7710/
Jansen, Klaus ;
Rolim, José D. P. ;
Williamson, David ;
Vempala, Santosh S.
LIPIcs, Volume 81, APPROX/RANDOM'17, Complete Volume
Abstract
LIPIcs, Volume 81, APPROX/RANDOM'17, Complete Volume
BibTeX - Entry
@InProceedings{jansen_et_al:LIPIcs:2017:7710,
author = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala},
title = {{LIPIcs, Volume 81, APPROX/RANDOM'17, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-044-6},
ISSN = {1868-8969},
year = {2017},
volume = {81},
editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7710},
URN = {urn:nbn:de:0030-drops-77101},
annote = {Keywords: Network Architecture and Design, Coding and Information Theory, Error Control Codes, Modes of Computation: Online computation, Complexity Measures and}
}
Keywords: |
|
Network Architecture and Design, Coding and Information Theory, Error Control Codes, Modes of Computation: Online computation, Complexity Measures and |
Freie Schlagwörter (englisch): |
|
Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems, Nonnumerical Algorithms and Problems |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) |
Issue Date: |
|
2017 |
Date of publication: |
|
21.08.2017 |