Continuous reductions among combinatorial optimization problems
Many reductions among combinatorial problems are known in the context of NP-completeness. These reductions preserve the optimality of solutions. However, they may change the ``relative error'' of approximative solutions dramatically. In this paper, we apply a new type of reductions, called continuous reductions. When one problem is continuously reduced to another, any approximation algorithm for the latter problem can be transformed into an approximation algorithm for the former. Moreover, the performance ratio is preserved up to a constant factor. We relate the problem ``minimum number of inverters in CMOS-circuits'', which arises in the context of logic synthesis, to several ``classical'' combinatorial problems such as ``maximum independent set'' and ``deletion of a minimum number of vertices (edges) in order to obtain a bipartite (partial) subgraph''.
scientific article; zbMATH DE number 4078830