Elaboration and Analysis of Heuristics

Many mathematical problems (in particular those in the field of Discrete Mathematics) could be solved exactly only if one would accept an extremely high arithmetical effort and an inadequately high time consumption. Hence one is interested in approximation methods (heuristic), which deliver good approximations for the desired solution and whose computational effort and time-demand is moderate.
This field of research constructs heuristics, analyzes the computational complexity and describes the quality of the achieved approximation.