Abstract

BibTeX - Entry

@Proceedings{jansen_et_al:LIPIcs.APPROX-RANDOM.2017,
  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 =	{Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2017/7710},
  URN =		{urn:nbn:de:0030-drops-77101},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2017},
  annote =	{Keywords: Network Architecture and Design, Coding and Information Theory, Error Control Codes, Modes of Computation: Online computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems, Nonnumerical Algorithms and Problems}
}

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

DROPS-Home | Fulltext Search | Imprint | Privacy