Improved Inapproximability Results for the Shortest Superstring and Related Problems.
CATS '13: Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141（2013）
摘要
We develop a new method for proving explicit approximation lower bounds for the Shortest Superstring problem, the Maximum Compression problem, the Maximum Asymmetric TSP problem, the (1, 2)--ATSP problem and the (1, 2)--TSP problem improving on the best known approximation lower bounds for those problems.
更多查看译文
关键词
lower bound,ATSP problem,Maximum Asymmetric TSP problem,Maximum Compression problem,Shortest Superstring problem,TSP problem,explicit approximation,new method,Improved inapproximability result,related problem,shortest superstring
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要