Off-Line Maintenance of Planar Configurations
From MaRDI portal
Recommendations
Cited in
(26)- Improved algorithms for several network location problems with equality measures.
- 2-medians in trees with pos/neg weights
- Trajectory planning for an articulated probe
- Efficient planar two-center algorithms
- Efficient algorithms for center problems in cactus networks
- Primal-dual simplex method for multiobjective linear programming
- Proximity problems on line segments spanned by points
- scientific article; zbMATH DE number 1617248 (Why is no real title available?)
- Covering Points with Convex Sets of Minimum Size
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Minimax flow tree problems
- Processing an offline insertion-query sequence with applications
- Incremental and Decremental Maintenance of Planar Width
- Free-form surface partition in 3-d
- Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
- Semi-Online Maintenance of Geometric Optima and Measures
- scientific article; zbMATH DE number 2119700 (Why is no real title available?)
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
- Processing an Offline Insertion-Query Sequence with Applications
- Weighted Rectilinear Approximation of Points in the Plane
- Dynamic convex hulls under window-sliding updates
- Efficient \(k\)-center algorithms for planar points in convex position
- A linear-time algorithm for the center problem in weighted cycle graphs
- Dynamic convex hulls under window-sliding updates
- Constrained two-line center problems
- Dynamic convex hulls for simple paths
This page was built for publication: Off-Line Maintenance of Planar Configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837379)
