A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We present a method to derandomize RN C algorithms, converting them to N C algorithms. Using it, we show how to approximate a class of N P -hard integer programming problems in N C, to within factors better than the current-best N C algorithms (of Berger & Rompel and Motwani, Naor & Naor); in some cases, the approximation factors are as good as the best-known sequential algorithms, due to Raghavan. This class includes problems such as global wire-routing in VLSI gate arrays and a generalizationdoi:10.1007/bf02523683 fatcat:7mmkyhnnbrbafldjieg5r55hxa