Résumé
Over the past few decades, the study of dense structures from the perspective of approximation algorithms has become a wide area of research. However, from the viewpoint of parameterized algorithm, this area is largely unexplored. In particular, properties of random samples have been successfully deployed to design approximation schemes for a number of fundamental problems on dense structures [Arora et al. FOCS 1995, Goldreich et al. FOCS 1996, Giotis and Guruswami SODA 2006, Karpinksi and Schudy STOC 2009]. In this paper, we fill this gap, and harness the power of random samples as well as structure theory to design kernelization as well as parameterized algorithms on dense structures. In particular, we obtain linear vertex kernels for Edge-Disjoint PATHS, EDGE ODD CYCLE TRANSVERSAL, MINIMUM BISECTION, d-WAY CUT, MULTIWAY CUT and MULTICUT on everywhere dense graphs. In fact, these kernels are obtained by designing a polynomial-time algorithm when the corresponding parameter is at most Omega(n). Additionally, we obtain a cubic kernel for VERTEX-DISJOINT PATHS on everywhere dense graphs. In addition to kernelization results, we obtain randomized subexponential-time parameterized algorithms for Edge ODD CYCLE TRANSVERSAL, MINIMUM BISECTION, and d-WAY CUT. Finally, we show how all of our results (as well as EPASes for these problems) can be de-randomized.