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.
Goemans , Booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
New bicriteria approximations for bounded-degree TSP variants achieve additive degree violations (+2 for circuits) and match Christofides-Serdyukov cost ratios, answering an open question on additive violations.
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.
-
Improved Algorithms for Bounded-Degree (Subset) Traveling Salesman Problems
New bicriteria approximations for bounded-degree TSP variants achieve additive degree violations (+2 for circuits) and match Christofides-Serdyukov cost ratios, answering an open question on additive violations.