MAS/MaxST admits an FPT algorithm for integer weights and an XP algorithm for rational weights ≥1, both finding acyclic subgraphs of weight at least MaxST(G)+k.
Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing , pages =
4 Pith papers cite this work, alongside 854 external citations. Polarity classification is still indexing.
4
Pith papers citing it
854
external citations · external index
representative citing papers
Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.
The paper reformulates polymorphisms in CSPs and PCSPs as right Kan extensions and supplies purely categorical proofs that complexity is determined by these structures.
Existence is proved of a slowed-down sticky Brownian motion that induces a MAXCUT rounding attaining the Goemans-Williamson approximation ratio.
citing papers explorer
-
Exploiting Spanning Trees for Directed Acyclicity
MAS/MaxST admits an FPT algorithm for integer weights and an XP algorithm for rational weights ≥1, both finding acyclic subgraphs of weight at least MaxST(G)+k.
-
Multi-Source Reachability in Near-Optimal Time
Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.
-
A categorical perspective on constraint satisfaction: The wonderland of adjunctions
The paper reformulates polymorphisms in CSPs and PCSPs as right Kan extensions and supplies purely categorical proofs that complexity is determined by these structures.
-
Krivine diffusions attain the Goemans--Williamson approximation ratio
Existence is proved of a slowed-down sticky Brownian motion that induces a MAXCUT rounding attaining the Goemans-Williamson approximation ratio.