|
|||||
|
|
Weighted amplifiers and inapproximability results for Travelling Salesman problem |
|
| Authors: | Chlebík Miroslav Chlebíková Janka |
| Institution: | 1.Department of Mathematics, University of Sussex, Brighton, UK ;2.School of Computing, University of Portsmouth, Portsmouth, UK ; |
| Abstract: | Journal of Combinatorial Optimization - The expander graph constructions and their variants are the main tool used in gap preserving reductions to prove approximation lower bounds of combinatorial... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |