Pages that link to "Item:Q4376177"
From MaRDI portal
The following pages link to An Expander-Based Approach to Geometric Optimization (Q4376177):
Displaying 14 items.
- Reverse shortest path problem for unit-disk graphs (Q832915) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Covering point sets with two disjoint disks or squares (Q929745) (← links)
- On regular vertices of the union of planar convex objects (Q1017923) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Reverse shortest path problem in weighted unit-disk graphs (Q2154091) (← links)
- An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
- Shortest paths in intersection graphs of unit disks (Q2344058) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- Proximity problems on line segments spanned by points (Q2489537) (← links)
- COVERING A POINT SET BY TWO DISJOINT RECTANGLES (Q3089094) (← links)
- Constrained square-center problems (Q5054846) (← links)
- On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)
