- PrevTheory of Computation 23.09.19
- NextDependable Computing 23.09.19
Engineering Hall 4, Room D713
Combinatorial Optimization Lab conducts research in the design and analysis of algorithms, particularly for combinatorial optimization problems. Decisions are being made continuously and ubiquitously, ranging from long-term business decisions to split-second scheduling of processes on a computer. The theory of combinatorial optimization enables us to formulate the search of optimal decisions in these situations as concrete mathematical problems. Primary research topics of the lab include the design of approximation algorithms and online algorithms for combinatorial optimization, and the application of these algorithms to optimization problems arising in practice. Approximation algorithms are efficient algorithms that find near-optimal solutions with provable performance guarantees; online algorithms produce their outputs "in real time" without waiting to read the entire input. These algorithms, naturally, can be deployed to address practical optimization problems that can sometimes be intractable. The lab actively engages in international collaboration with outstanding researchers from outside Korea. Its research results are published in prestigious venues in theoretical computer science.