Quell

DOI10.1016/J.TCS.2015.05.044zbMATH Open1330.68095OpenAlexW4206017766MaRDI QIDQ500997FDOQ500997

Authors: Pedro J. Tejada, Haitao Wang, Minghui 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

Recommendations

• scientific article; zbMATH DE number 1944412
• The complexity of flood filling games
• \textsc{Pull} and \textsc{PushPull} are PSPACE-complete
• On the complexity of Two Dots for narrow boards and few colors
• The complexity of flood-filling games on graphs

zbMATH Keywords

approximation algorithmstraveling salesman problemfixed-parameter tractabilityhardness of approximationcombinatorial game theory

Mathematics Subject Classification ID

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)

Cites Work

• The design of approximation algorithms
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Assembling molecules in ATOMIX is hard
• Color-coding
• Some optimal inapproximability results
• Computational geometry. Algorithms and applications.
• On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
• An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
• On the approximability of the traveling salesman problem
• Games, puzzles, and computation
• On weighted vs unweighted versions of combinatorial optimization problems
• Randolphs Robot Game is NP-hard!
• Title not available (Why is that?)
• Quell

Cited In (1)

• Quell

This page was built for publication: Quell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q500997)