Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space.
Falko HegerfeldStefan KratschPublished in: CoRR (2020)
Keyphrases
- solving problems
- solving complex
- optimization problems
- problems involving
- sparse linear systems
- np complete
- combinatorial optimization
- exact solution
- database
- difficult problems
- average case complexity
- combinatorial optimisation
- np complete problems
- graph coloring
- search heuristics
- nonlinear programming
- case study
- real time