arXiv (All)
open access
Improved Sublinear Algorithms for Maximal Independent Set and Metric Steiner Forest
In this work we consider the Maximal Independent Set (MIS) problem and the metric Steiner Forest problem in the sublinear time setting, under the adjacency/distance matrix query model. First, we give an algorithm that estimates the size of an MIS up to a multiplicative factor of $(1+\eps)$ using $\t
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
- An $n^{0.3+\varepsilon}$-Approximation for Steiner $k$-Forest#1234299
- Bellman's Forest Problem and Computability#1106051
- Spherical fuzzy hypergraph in decision making.#165655
- Intersections of Directed Graphs#1050273
- W[1]-Hardness of Upper Clique Transversal#1200568
Record · ID 1202472
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