Login / Signup
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs.
Siamak Tazari
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
approximation schemes
graph theory
highly efficient
combinatorial optimization
memory efficient
objective function
search algorithm
search space
active contours
orders of magnitude
approximation algorithms
numerical methods
computationally demanding