Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)
From MaRDI portal
Publication:2817638
DOI10.1145/195058.195233zbMath1345.68276MaRDI QIDQ2817638
Madhav V. Marathe, Harry B. III Hunt, Richard E. Stearns, Venkatesh Radhakrishnan
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195233
68Q25: Analysis of algorithms and problem complexity
05C10: Planar graphs; geometric and topological aspects of graph theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
