Tarnawski, Jakub2021-07-082021-07-082021https://dl.gi.de/handle/20.500.12116/36759This article gives a short overview of my dissertation, where new algorithms are given for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. The first part of the dissertation addresses a benchmark problem in combinatorial optimization: the asymmetric traveling salesman problem (ATSP). It consists in finding the shortest tour that visits all vertices of a given edge-weighted directed graph. A ρ -approximation algorithm for ATSP is one that runs in polynomial time and always produces a tour at most ρ times longer than the shortest tour. Finding such an algorithm with constant ρ had been a long-standing open problem. Here we give such an algorithm. The second part of the dissertation addresses the perfect matching problem. We have known since the 1980s that it has efficient parallel algorithms if the use of randomness is allowed. However, we do not know if randomness is necessary – that is, whether the matching problem is in the class NC . We show that it is in the class quasi-NC . That is, we give a deterministic parallel algorithm that runs in poly-logarithmic time on quasi-polynomially many processors.engraph algorithmstraveling salesman problemperfect matchingderandomizationparallel algorithmsapproximation algorithmsText/Journal Article10.1515/itit-2021-00142196-7032