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.FSTTCS.2014.1
URN: urn:nbn:de:0030-drops-48275
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2014/4827/
Go to the corresponding LIPIcs Volume Portal

Bansal, Nikhil

New Developments in Iterated Rounding (Invited Talk)

pdf-format:
2.pdf (0.4 MB)

Abstract

Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity has led to several remarkable new results and also simpler proofs of many previous results. We will briefly survey some applications of the method, including some recent developments and giving a high level overview of the ideas.

BibTeX - Entry

@InProceedings{bansal:LIPIcs:2014:4827,
  author =	{Nikhil Bansal},
  title =	{{New Developments in Iterated Rounding (Invited Talk)}},
  booktitle =	{34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)},
  pages =	{1--10},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-77-4},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{29},
  editor =	{Venkatesh Raman and S. P. Suresh},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2014/4827},
  URN =		{urn:nbn:de:0030-drops-48275},
  doi =		{10.4230/LIPIcs.FSTTCS.2014.1},
  annote =	{Keywords: Algorithms, Approximation, Rounding}
}

Keywords: Algorithms, Approximation, Rounding
Collection: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)
Issue Date: 2014
Date of publication: 12.12.2014

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