|
|
|
| |
|
|
|
 |
|
|
|
|
|
 |
Title |
|
| |
Speaker |
Otfried Cheong |
|
| |
Date |
2017-04-03 |
|
| |
Host |
|
|
| |
Place |
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. |
|
|
 |
|
|
|
.jpg)
