Abstract
A technique is presented by which NC and RNC algorithms for some problems can be extended into NC and RNC algorithms, respectively, that solve more general parametric problems. The technique is demonstrated on explicit bounded degree circuits. Applications include parametric extensions of the shortest-path and spanning-tree problems and, in particular, the minimum-ratio-cycle problem, showing all these problems are in NC.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Megiddo, Combinatorial optimization with rational objective functions,Math. Oper. Res. 4 (1979) 414–424.
N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms,J. Assoc. Comput. Mach. 30, 4 (1983) 337–341.
N. Megiddo and A. Tamir, Finding least-distances lines,SIAMJ. Algebraic Discrete Methods 4, 2 (1983) 207–211.
N. Megiddo and A. Tamir, New results on the complexity of p-center problems,SIAM J. Comput. 12, 4 (1983) 751–758.
N. Megiddo and E. Zemel, A randomizingO(n logn) algorithm for the weighted 1-center problem,J. Algorithms 1 (1986) 358–368.
Author information
Authors and Affiliations
Additional information
Communicated by F. Thomson Leighton.
Rights and permissions
About this article
Cite this article
Megiddo, N. Extending NC and RNC algorithms. Algorithmica 4, 511–517 (1989). https://doi.org/10.1007/BF01553905
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01553905