arXiv (All)
open access
Improved Approximation and Hardness Results for the Monitoring Edge-Geodetic Set Problem
We study the \emph{Monitoring Edge-Geodetic Set} problem (MEG-Set), which asks for a minimum-cardinality set $M$ of vertices of an undirected graph $G$ of $n$ vertices such that every edge of $G$ belongs to all shortest paths between some pair of vertices in $M$. We present new approximation and h
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
- On the (In)Approximability of the Monitoring Edge Geodetic Set Problem#1328304
- Characterizing optimal monitoring edge-geodetic sets for some structured graph classes#14161
- Algorithms and complexity for monitoring edge-geodetic sets in graphs#291915
- Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors#1227302
- Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors#1233986
Record · ID 1411910
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