Combinatorial optimization problems: packing and related problems

• Grant number: 13/02434-8
• Support Opportunities: Research Grants - Visiting Researcher Grant - International
• Start date: August 03, 2013
• End date: September 02, 2013
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Principal Investigator: Flávio Keidi Miyazawa
• Grantee: Flávio Keidi Miyazawa
• Visiting researcher: Maxim Sviridenko
• Visiting researcher institution: University of Warwick, England
• Host Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil

Abstract

The objective of this project is to enable the visit of Prof. Maxim Sviridenko, from the University of Warwick, England, to the Institute of Computing / University of Campinas, with the objective to obtain new research results and academic collaborations. The project includes the investigation of combinatorial optimization research problems, mainly in packing problems. Our objective is to develop new approximation algorithms. Besides the research activities, we include the presentations of lectures; visit to the Institute of Mathematics and Statistics of the University of Sao Paulo and collaboration with graduate students of the Institute of Computing of University of Campinas. (AU)

Scientific publications

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.; SVIRIDENKO, MAXIM; WAKABAYASHI, YOSHIKO. Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. ALGORITHMICA, v. 76, n. 2, p. 536-568, OCT 2016. (10/20710-4, 13/03447-6, 13/21744-8, 13/02434-8)