Papers › Faster parameterized algorithm for 3-Hitting Set
Faster parameterized algorithm for 3-Hitting Set
Dekel Tsur
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In the 3-Hitting Set problem, the input is a hypergraph G such that the size of every hyperedge of G is at most 3, and an integers k, and the goal is to decide whether there is a set S of at most k vertices such that every hyperedge of G contains at least one vertex from S. In this paper we give an O^*(2.0409ᵏ)-time algorithm for 3-Hitting Set.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections