Abstract.
An alternative viewpoint for parametric search is presented, which achieves a bound similar to that of Cole's improvement on Megiddo's method. The new technique simulates the algorithm for the underlying fixed-parameter problem simultaneously over multiple computation paths and applies naturally to linear and nonlinear problems. The uses of the method are illustrated with examples from optimization on weighted graphs and dynamic geometry, including maximum spanning trees, diameter, and smallest enclosing ball.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received January 6, 1998; revised December 21, 1998.
Rights and permissions
About this article
Cite this article
Fernández-Baca, D. On Nonlinear Parametric Search . Algorithmica 30, 1–11 (2001). https://doi.org/10.1007/s00453-001-0001-2
Issue Date:
DOI: https://doi.org/10.1007/s00453-001-0001-2