License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-54012
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5401/
Go to the corresponding LIPIcs Volume Portal


Garg, Naveen ; Jansen, Klaus ; Rao, Anup ; Rolim, Josť D. P.

LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume

pdf-format:
lipics-vol40-approx-random2015-complete.pdf (29 MB)


Abstract

LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume

BibTeX - Entry

@InProceedings{garg_et_al:LIPIcs:2015:5401,
  author =	{Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'e} D. P. Rolim},
  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 =	{Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'e} D. P. Rolim},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5401},
  URN =		{urn:nbn:de:0030-drops-54012},
  annote =	{Keywords: Data Structures, Coding and Information Theory, Theory of Computation, Computation by Abstract Devices, Modes of Computation, Complexity Measures and }
}

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
Seminar: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Issue Date: 2015
Date of publication: 27.08.2015


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