Quell
DOI10.1016/j.tcs.2015.05.044zbMath1330.68095OpenAlexW4206017766MaRDI QIDQ500997
Haitao Wang, Pedro J. Tejada, Ming-Hui Jiang
Publication date: 8 October 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.044
traveling salesman problemapproximation algorithmscombinatorial game theoryhardness of approximationfixed-parameter tractability
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Combinatorial games (91A46)
Related Items (1)
Cites Work
- Quell
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- On weighted vs unweighted versions of combinatorial optimization problems
- Assembling molecules in ATOMIX is hard
- On the approximability of the traveling salesman problem
- The Design of Approximation Algorithms
- Randolphs Robot Game is NP-hard!
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- Color-coding
- Some optimal inapproximability results
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Quell
