Every k-edge-connected graph has a polynomially constructible spanning tree that is O(1/k)-thin for all η-near-minimum cuts with η = 1/40.
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Thin Trees for Near Minimum Cuts
Every k-edge-connected graph has a polynomially constructible spanning tree that is O(1/k)-thin for all η-near-minimum cuts with η = 1/40.