Document Open Access Logo

New Developments in Iterated Rounding (Invited Talk)

Author Nikhil Bansal

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2014.1.pdf
  • Filesize: 400 kB
  • 10 pages

Document Identifiers

Subject Classification

Keywords
  • Algorithms
  • Approximation
  • Rounding

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Nikhil Bansal. New Developments in Iterated Rounding (Invited Talk). In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 29, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014) https://doi.org/10.4230/LIPIcs.FSTTCS.2014.1

Author Details

Nikhil Bansal

References

  1. Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, and Shi Li. Better algorithms and hardness for broadcast scheduling via a discrepancy approach. In SODA, pages 55-71, 2014. Google Scholar
  2. Nikhil Bansal and Janardhan Kulkarni. Minimizing flow-time on unrelated machines. CoRR, abs/1401.7284, 2014. Google Scholar
  3. David G. Harris and Aravind Srinivasan. The moser-tardos framework with partial resampling. In FOCS, pages 469-478, 2013. Google Scholar
  4. Narendra Karmarkar and Richard M. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In FOCS, pages 312-320, 1982. Google Scholar
  5. Lap-Chi Lau, R. Ravi, and Mohit Singh. Iterative Methods in Combinatorial Optimization. Cambridge University Press, 2011. Google Scholar
  6. Jan Karel Lenstra, David B. Shmoys, and Éva Tardos. Approximation algorithms for scheduling unrelated parallel machines. Math. Program., 46:259-271, 1990. Google Scholar
  7. Shachar Lovett and Raghu Meka. Constructive discrepancy minimization by walking on the edges. In FOCS, pages 61-67, 2012. Google Scholar
  8. Thomas Rothvoss. Approximating bin packing within o(log OPT * log log OPT) bins. In FOCS, pages 20-29, 2013. Google Scholar
  9. Mohit Singh and Lap Chi Lau. Approximating minimum bounded degree spanning trees to within one of optimal. In STOC, pages 661-670, 2007. Google Scholar
  10. David Williamson and David Shmoys. The design of Approximation Algorithms. Cambridge University Press, 2011. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact