New developments in iterated rounding

N. Bansal

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)
65 Downloads (Pure)

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.
Original languageEnglish
Title of host publication34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014, New Dehli, India, December 15-17, 2014)
EditorsV. Raman, S.P. Suresh
Place of PublicationDagstuhl
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Pages1-10
ISBN (Print)978-3-939897-77-4
DOIs
Publication statusPublished - 2014
Eventconference; 34th International Conference on Foundation of Software Technology and Theoretical Computer Science; 2014-12-15; 2014-12-17 -
Duration: 15 Dec 201417 Dec 2014

Publication series

NameLIPIcs: Leibniz International Proceedings in Informatics
Volume29
ISSN (Print)1868-8968

Conference

Conferenceconference; 34th International Conference on Foundation of Software Technology and Theoretical Computer Science; 2014-12-15; 2014-12-17
Period15/12/1417/12/14
Other34th International Conference on Foundation of Software Technology and Theoretical Computer Science

Fingerprint

Dive into the research topics of 'New developments in iterated rounding'. Together they form a unique fingerprint.

Cite this