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.2015
URN: urn:nbn:de:0030-drops-54012
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5401/
Garg, Naveen ;
Jansen, Klaus ;
Rao, Anup ;
Rolim, José D. P.
LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume
Abstract
LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume
BibTeX - Entry
@Proceedings{garg_et_al:LIPIcs.APPROX-RANDOM.2015,
title = {{LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-89-7},
ISSN = {1868-8969},
year = {2015},
volume = {40},
editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2015/5401},
URN = {urn:nbn:de:0030-drops-54012},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2015},
annote = {Keywords: Data Structures, Coding and Information Theory, Theory of Computation, Computation by Abstract Devices, Modes of Computation, Complexity Measures and Problem Complexity, Numerical Algorithms and Problems, Nonnumerical Algorithms and Problems, Approximation, Numerical Linear Algorithms and Problems}
}
Keywords: |
|
Data Structures, Coding and Information Theory, Theory of Computation, Computation by Abstract Devices, Modes of Computation, Complexity Measures and |
Freie Schlagwörter (englisch): |
|
Problem Complexity, Numerical Algorithms and Problems, Nonnumerical Algorithms and Problems, Approximation, Numerical Linear Algorithms and Problems |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015) |
Issue Date: |
|
2015 |
Date of publication: |
|
27.08.2015 |