On Approximability of Bounded Degree Instances of Selected Optimization Problems

Abstract

In order to cope with the approximation hardness of an underlying optimization problem, it is advantageous to consider specific families of instances with properties that can be exploited to obtain efficient approximation algorithms for the restricted version of the problem with improved performance guarantees. In this thesis, we investigate the… (More)

101 Figures and Tables

Topics

  • Presentations referencing similar topics