Logspace optimization problems and their approximability properties
DOI10.1007/S00224-007-2011-1zbMATH Open1176.90517OpenAlexW2012929520MaRDI QIDQ2642909FDOQ2642909
Authors: Till Tantau 
Publication date: 6 September 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-2011-1
Recommendations
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) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (14)
- On stalling in LogP
- Depth-first search in directed planar graphs, revisited
- Frameworks for designing in-place graph algorithms
- A framework for in-place graph algorithms
- Uniform-circuit and logarithmic-space approximations of refined combinatorial optimization problems
- Title not available (Why is that?)
- A note on logspace optimization
- Fundamentals of Computation Theory
- Title not available (Why is that?)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis
- Approximation in (Poly-) Logarithmic Space
- A Logspace Algorithm for Partial 2-Tree Canonization
- Log-space algorithms for paths and matchings in \(k\)-trees
- Approximation in (poly-) logarithmic space
This page was built for publication: Logspace optimization problems and their approximability properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642909)
