arXiv (All)
open access
A Near-Linear Element Kernel for \(d\)-Hitting Set
In \(d\)-\textsc{Hitting Set}, the input consists of a finite universe \(U\), a family \(\mathcal S\) of subsets of \(U\) with size at most \(d\), and an integer \(k\). The task is to decide whether at most \(k\) elements of \(U\) can intersect every set in \(\mathcal S\). For every fixed \(d\geq3\)
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Opposition-based learning memetic algorithm for the maximum intersection of k-subsets problem#231625
- Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra#144227
- On the Complexity of Forcing and Anti-Forcing Minimum Cuts#1118004
- Deconstructing Subset Construction -- Reducing While Determinizing#139164
- Efficient Coreset Selection via K-Nearest Neighbor Graphs#620675
Record · ID 974083
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive