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.
Title resolution pending
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
A new ordered local search algorithm achieves k/2 + o(k) approximation for monotone submodular maximization over k matroids and (ln 4 k)/3 + o(k) for weighted k-set packing.
citing papers explorer
-
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.
-
Submodular Maximization over Many Matroids via Ordered Local Search
A new ordered local search algorithm achieves k/2 + o(k) approximation for monotone submodular maximization over k matroids and (ln 4 k)/3 + o(k) for weighted k-set packing.