Weighted amplifiers and inapproximability results for Travelling Salesman problem
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-020-00659-0
Abstract: The expander graph constructions and their variants are the main tool used in gap preserving reductions to prove approximation lower bounds of combinatorial optimisation problems. In this paper we introduce the weighted amplifiers and weighted… read more here.
Keywords: amplifiers inapproximability; results travelling; salesman problem; weighted amplifiers ... See more keywords