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.
and Klein, Nathan and
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.DS 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Maximum entropy algorithm is a 10/7-approximation for TSP on half-integral cycle cut instances.
Reduction from prize-collecting-Φ-TSP to prize-collecting TSP yields (ρ + ε)-approximations for constant prescribed vertices, improving the prize-collecting stroll guarantee to better than 1.6 from 1.6662.
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.
-
Maximum Entropy is a 10/7-Approximation Algorithm for the TSP on Half-Integral Cycle Cut Instances
Maximum entropy algorithm is a 10/7-approximation for TSP on half-integral cycle cut instances.
-
Reducing Prize-Collecting Stroll and Related Routing Problems to Prize-Collecting TSP
Reduction from prize-collecting-Φ-TSP to prize-collecting TSP yields (ρ + ε)-approximations for constant prescribed vertices, improving the prize-collecting stroll guarantee to better than 1.6 from 1.6662.