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-47603
URL: https://drops.dagstuhl.de/opus/volltexte/2014/4760/
Go to the corresponding LIPIcs Volume Portal


Jansen, Klaus ; Rolim, José D. P. ; Devanur, Nikhil R. ; Moore, Cristopher

LIPIcs, Volume 28, APPROX/RANDOM'14, Complete Volume

pdf-format:
lipics-vol28-approx-random-2014-complete.pdf (27 MB)


Abstract

LIPIcs, Volume 28, APPROX/RANDOM'14, Complete Volume

BibTeX - Entry

@InProceedings{jansen_et_al:LIPIcs:2014:4760,
  author =	{Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore},
  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 =	{Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2014/4760},
  annote =	{Keywords: Network Architecture and Design, Computer-communication, Coding and Information Theory, Theory of Computation, Computation by Abstract Devices, }
}

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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI