Pages that link to "Item:Q3837379"
From MaRDI portal
The following pages link to Off-Line Maintenance of Planar Configurations (Q3837379):
Displaying 16 items.
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
- Improved algorithms for several network location problems with equality measures. (Q1408453) (← links)
- 2-medians in trees with pos/neg weights (Q1582068) (← links)
- Trajectory planning for an articulated probe (Q2206741) (← links)
- Efficient planar two-center algorithms (Q2230394) (← links)
- Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
- Primal-dual simplex method for multiobjective linear programming (Q2471113) (← links)
- Proximity problems on line segments spanned by points (Q2489537) (← links)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
- Dynamic planar convex hull operations in near-logarithmic amortized time (Q2947001) (← links)
- Minimax flow tree problems (Q3057112) (← links)
- Incremental and Decremental Maintenance of Planar Width (Q4521530) (← links)
- FREE-FORM SURFACE PARTITION IN 3-D (Q4650082) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- Weighted Rectilinear Approximation of Points in the Plane (Q5458566) (← links)
- A linear-time algorithm for the center problem in weighted cycle graphs (Q6551721) (← links)
