KAIST Discrete Math Seminar

Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic methodologies, such as LP-rounding and primal-dual method, have been applied to and evolved from algorithms for this problem. Unfortunately, this collection of powerful algorithmic techniques had not yet been applicable to the more general capacitated facility location problem. In fact, all of the known algorithms with good performance guarantees were based on a single technique, local search, and no linear programming relaxation was known to efficiently approximate the problem.
In this paper, we present a linear programming relaxation with constant integrality gap for capacitated facility location. We demonstrate that the fundamental theories of multi-commodity flows and matchings provide key insights that lead to the strong relaxation. Our algorithmic proof of integrality gap is obtained by finally accessing the rich toolbox of LP-based methodologies: we present a constant factor approximation algorithm based on LP-rounding.
Joint work with Mohit Singh and Ola Svensson.

A graph is (d₁, …, d_r)-colorable if its vertex set can be partitioned into r sets V₁, …, V_r where the maximum degree of the graph induced by V_i is at most d_i for each i in {1, …, r}.
Given r and d₁, …, d_r, determining if a (sparse) graph is (d₁, …, d_r)-colorable has attracted much interest.
For example, the Four Color Theorem states that all planar graphs are 4-colorable, and therefore (0, 0, 0, 0)-colorable.
The question is also well studied for partitioning planar graphs into three parts.
For two parts, it is known that for given d₁ and d₂, there exists a planar graph that is not (d₁, d₂)-colorable.
Therefore, it is natural to study the question for planar graphs with girth conditions.
Namely, given g and d₁, determine the minimum d₂=d₂(g, d₁) such that planar graphs with girth g are (d₁, d₂)-colorable. We continue the study and ask the same question for graphs that are embeddable on a fixed surface.
Given integers k, γ, g we completely characterize the smallest k-tuple (d₁, …, d_k) in lexicographical order such that each graph of girth at least g that is embeddable on a surface of Euler genus γ is (d₁, …, d_k)-colorable.
All of our results are tight, up to a constant multiplicative factor for the degrees d_i depending on g.
In particular, we show that a graph embeddable on a surface of Euler genus γ is (0, 0, 0, K₁(γ))-colorable and (2, 2, K₂(γ))-colorable, where K₁(γ) and K₂(γ) are linear functions in γ.This talk is based on results and discussions with H. Choi, F. Dross, L. Esperet, J. Jeong, M. Montassier, P. Ochem, A. Raspaud, and G. Suh.

In this talk, I attempt to provide a comprehensive introduction to the matroid properties that hold for almost all matroids.
Welsh conjectured that almost all matroids are paving, open for nearly 50 years. If true, the properties of paving matroids translate to almost all matroids, such as non-representability, concentrated ranks, high connectivity and so on. We shall see the related properties that are shown to hold for almost all matroids with some of the proofs. An overview of recent progress and possible further directions will also be presented.