![]() Lugar: Auditorio Phillippe Flajolet, Depto. In his research he focuses on combinatorial optimization and approximation algorithms, i.e., on algorithms that are efficient and compute solutions that are provably close to the optimum.įecha: 12 de octubre de 2018, 12.30 a 13.30 horas. He finished his PhD in 2011 at TU Berlin and was a postdoc at TU Berlin, La Sapienza in Rome and at the MPI for Informatics in Saarbruecken. ![]() ![]() Key to all results is to show that there are good solutions that have a relatively simple structure.īio: Andreas Wiese is an assistant professor at the Industrial Engineering department of the Universidad de Chile. I will present an algorithm with an approximation ratio of 1.89+eps and varios other results for the problem. This problem generalizes the well-studied (one-dimensional) knapsack problem. The goal is to pack a subset of the given items non-overlappingly into the knapsack in order to maximize the total profit of the packed items. Each item has a profit associated with it. Given are a square knapsack and a set of items that are axis-parallel rectangles. Unfortunately, it turns out that this approximation algorithm is not monotone It can be tweaked to be monotone, but this requires a bit more background in. In this talk I will present approximation algorithms for the 2-dimensional knapsack problem. There is an FPTAS (fully polynomial time approximation scheme) for Knap-sack: an algorithm with approximation ratio of 1 and running time polynomial in nand 1 for all >0. Therefore, we are interested in approximation algorithms which are algorithms that run in polynomial time and provably find solutions that differ from the optimum by at most some bounded factor, called the approximation ratio. The weights (Wi) and profit values (Pi) of the items to be added in the knapsack are taken as an input for the fractional knapsack algorithm and the subset of. We describe a general technique to design PTASs, and apply it to the famous Knapsack problem. Abstract: Many optimization problems are NP-hard and therefore we do not expect to find algorithms for them that are efficient, i.e., run in polynomial time, and find the optimal solution for any given instance. In this module we will introduce the concept of Polynomial-Time Approximation Scheme (PTAS), which are algorithms that can get arbitrarily close to an optimal solution. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |