A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
[article]
2022
arXiv
pre-print
We revisit recent developments for the Maximum Weight Independent Set problem in graphs excluding a subdivided claw S_t,t,t as an induced subgraph [Chudnovsky, Pilipczuk, Pilipczuk, Thomassé, SODA 2020] and provide a subexponential-time algorithm with improved running time 2^𝒪(√(n)log n) and a quasipolynomial-time approximation scheme with improved running time 2^𝒪(ε^-1log^5 n). The Gyárfás' path argument, a powerful tool that is the main building block for many algorithms in P_t-free graphs,
arXiv:2203.04836v1
fatcat:aoalxcrsc5gfnf2ijr6rk63kfq