The dynamic program can be implemented on top of an unbreakable decomposition using algebraic techniques and compute in time a tree decomposition with adhesions of size at most $2k$ whose bags are $(3k,k)$-edge-unbreakable inside their own subtrees.
Aditya Anand, Evangelos Kipouridis, Karol Węgrzycki· 0 citations
The main ingredient is a new algorithm for closing additional centers in parameterized time inspired by local search and the first constant-factor FPT-approximation parameterized by the number of groups $\ell$, resolving the open question raised by Ghadiri, Singh, and Vempala (2022).
Aditya Anand, Yu. S. Makarychev, Liren Shan· 0 citations
A new dual fitting algorithm is given which tightly accounts for dual payments while still facilitating an effective dual feasibility analysis, and a new framework that uses spectral analysis for determining the approximation factor of the algorithm is introduced.
Aditya Anand, Moses Charikar, Vincent Cohen-Addad et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.