TY - GEN
T1 - Improved parallel approximation of a class of integer programming problems
AU - Alon, Noga
AU - Srinivasan, Aravind
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1996.
PY - 1996
Y1 - 1996
N2 - We present a method to derandomize RNC algorithms, converting them to NC algorithms. Using it, we show how to approximate a class of iVP-hard integer programming problems in NC, to within factors better than the current-best NC algorithms (of Berger &c 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. Also for a subfamily of the "packing" integer programs, we provide the first NC approximation algorithms; this includes problems such as maximum matchings in hypergraphs, and generalizations. The key to the utility of our method is that it involves sums of superpolynomially many terms, which can however be computed in NC; this superpolynomiality is the bottleneck for some earlier approaches.
AB - We present a method to derandomize RNC algorithms, converting them to NC algorithms. Using it, we show how to approximate a class of iVP-hard integer programming problems in NC, to within factors better than the current-best NC algorithms (of Berger &c 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. Also for a subfamily of the "packing" integer programs, we provide the first NC approximation algorithms; this includes problems such as maximum matchings in hypergraphs, and generalizations. The key to the utility of our method is that it involves sums of superpolynomially many terms, which can however be computed in NC; this superpolynomiality is the bottleneck for some earlier approaches.
UR - http://www.scopus.com/inward/record.url?scp=84947715569&partnerID=8YFLogxK
U2 - 10.1007/3-540-61440-0_159
DO - 10.1007/3-540-61440-0_159
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84947715569
SN - 3540614400
SN - 9783540614401
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 562
EP - 573
BT - Automata, Languages and Programming - 23rd International Colloquium, ICALP 1996, Proceedings
A2 - Meyer auf der Heide, Friedhelm
A2 - Monien, Burkhard
PB - Springer Verlag
T2 - 23rd International Colloquium on Automata, Languages, and Programming, ICALP 1996
Y2 - 8 July 1996 through 12 July 1996
ER -