License:
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014
URN: urn:nbn:de:0030-drops-47603
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2014/4760/
Jansen, Klaus ;
Rolim, José D. P. ;
Devanur, Nikhil R. ;
Moore, Cristopher
LIPIcs, Volume 28, APPROX/RANDOM'14, Complete Volume
Abstract
LIPIcs, Volume 28, APPROX/RANDOM'14, Complete Volume
BibTeX - Entry
@Proceedings{jansen_et_al:LIPIcs.APPROX-RANDOM.2014,
title = {{LIPIcs, Volume 28, APPROX/RANDOM'14, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
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/opus/volltexte/2014/4760},
URN = {urn:nbn:de:0030-drops-47603},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014},
annote = {Keywords: Network Architecture and Design, Computer-communication, Coding and Information Theory, Theory of Computation, Computation by Abstract Devices, Models of Computation – relations between models, Modes of Computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity}
}
Keywords: |
|
Network Architecture and Design, Computer-communication, Coding and Information Theory, Theory of Computation, Computation by Abstract Devices, |
Freie Schlagwörter (englisch): |
|
Models of Computation – relations between models, Modes of Computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014) |
Issue Date: |
|
2014 |
Date of publication: |
|
22.09.2014 |