Logspace Optimisation Problems and their Approximation Properties

@article{Tantau2003LogspaceOP,
  title={Logspace Optimisation Problems and their Approximation Properties},
  author={Till Tantau},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2003}
}
  • Till Tantau
  • Published 2003 in Electronic Colloquium on Computational Complexity
This paper introduces logspace optimisation problems as analogues of the well-studied polynomial-time optimisation problems. Similarly to them, logspace optimisation problems can have vastly different approximation properties, even though the underlying existence and budget problems have the same computational complexity. Numerous natural problems are presented that exhibit such a varying complexity. They include the shortest path problems for directed graphs, undirected graphs, tournaments… CONTINUE READING

Similar Papers

Loading similar papers…