Tight Lower Bounds on the Approximability of Some NPO PB Complete Problems

Abstract

We investigate the approximability of the NPO PB complete problems Min Ones Min Dones Max Ones Max Dones and Max PB Programming We show that unless P NP these problems are not approximable within n for any where n is the number of variables in the input Since all of these problems are approximable within n this lower bound is close to optimal 

Topics

Cite this paper

@inproceedings{Jonsson2007TightLB, title={Tight Lower Bounds on the Approximability of Some NPO PB Complete Problems}, author={Peter Jonsson and Erik Sandewall}, year={2007} }