arXiv (All)
open access
Improved Lower Bound for Steiner Point Removal
In the Steiner Point Removal problem, we are given a graph $G=(V,E)$ with an edge-length function $\ell_G: E\rightarrow \mathbb{R}_+$ and a subset $T\subseteq V$ of terminals. The goal is to find a minor $H=(T, E_H)$ of $G$ on vertex set $T$ such that the shortest path metric derived from $G$ on the
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
- Pointwise boundary observation in geometric optimization problems associated to variational inequalities#630405
- Bipodal optimizers in the upper-tail variational problem for regular subgraph densities#1109267
- An Exact Dominant Degree Condition for Transitive Tournament Factors in Digraphs#986319
- Closed escape path of smallest diameter in forest: dual formulation of Lebesgue's universal covering problem#1117643
- Sparse Cuts for the Positive Semidefinite Cone#793594
Record · ID 1154800
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