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-66809
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6680/
Jansen, Klaus ;
Mathieu, Claire ;
Rolim, José D. P. ;
Umans, Chris
LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume
Abstract
LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume
BibTeX - Entry
@InProceedings{jansen_et_al:LIPIcs:2016:6680,
author = {Klaus Jansen and Claire Mathieu and Jos{\'e} D. P. Rolim and Chris Umans},
title = {{LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Klaus Jansen and Claire Mathieu and Jos{\'e} D. P. Rolim and Chris Umans},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6680},
URN = {urn:nbn:de:0030-drops-66809},
annote = {Keywords: Theory of Computation, Models of Computation, Modes of Computation – Online Computation, Complexity Measures and Classes, Analysis of Algorithms and }
}
Keywords: |
|
Theory of Computation, Models of Computation, Modes of Computation – Online Computation, Complexity Measures and Classes, Analysis of Algorithms and |
Freie Schlagwörter (englisch): |
|
Problem Complexity, Numerical Algorithms and Problems – Computations on Matrices, Nonnumerical Algorithms and Problems |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016) |
Issue Date: |
|
2016 |
Date of publication: |
|
12.09.2016 |