2026-08-15T12:10:30Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4827 2024-03-06T10:35:22Z ddc:004 open_access

New Developments in Iterated Rounding (Invited Talk) Bansal, Nikhil Algorithms Approximation Rounding 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nikhil Bansal 2014 Is Part Of LIPIcs, Volume 29, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2014.1 urn:nbn:de:0030-drops-48275 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.1 eng https://creativecommons.org/licenses/by/3.0/legalcode