Abstract
A technique for accelerating certain applications of parametric search to non-linear problems is presented, together with its applications to optimization on weighted graphs and to two problems in dynamic geometry on points moving in straight-line trajectories:computing the minimum diameter over all time and finding the time at which the length of the maximum spanning tree is minimized.
Cite
CITATION STYLE
Baca, D. F. (1998). Faster Non-linear parametric search with Applications to Optimization and Dynamic Geometry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1380, pp. 33–41). Springer Verlag. https://doi.org/10.1007/bfb0054308
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
