Cookie Setting MathNet Korea

이전페이지 이동
Putting your coin collection on a shelf
[2017 Discrete Math 세미나]
Date: 2017-04-03
Speaker : Otfried Cheong (KAIST)
Abstract : Imagine you want to present your collection of n coins on a shelf, taking as little space as possible – how should you arrange the coins? More precisely, we are given n circular disks of different radii, and we want to place them in the plane so that they touch the x-axis from above, such that no two disks overlap. The goal is to minimize the length of the range from the leftmost point on a disk to the rightmost point on a disk. On this seemingly innocent problem we will meet a wide range of algorithmic concepts: An efficient algorithm for a special case, an NP-hardness proof, an approximation algorithm with a guaranteed approximation factor, APX-hardness, and a quasi-polynomial time approximation scheme.
Information Center for Mathematical Sciences KAIST
34141 대전광역시 유성구 대학로 291 (구성동373-1)
한국과학기술원(KAIST) 수리과학정보센터
전화 042-350-8196
e-mail :
Copyright (C) 2018. ICMS All Rights Reserved.