A Polynomial-Time Approximation Algorithm for Complete Interval Minors

Romain Bourneuf, Julien Cocquet, Chaoliang Tang +1

As shown by Robertson and Seymour, deciding whether the complete graph $K_t$ is a minor of an input graph $G$ is a fixed parameter tractable problem when parameterized by $t$. From…