Pages that link to "Item:Q1207325"
From MaRDI portal
The following pages link to The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325):
Displaying 25 items.
- Covering moving points with anchored disks (Q421753) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- Generalized \(p\)-center problems: Complexity results and approximation algorithms (Q1278142) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
- The mixed center location problem (Q1631666) (← links)
- The connected disk covering problem (Q1702836) (← links)
- \(k\)-balanced center location problem: a new multi-objective facility location problem (Q1722964) (← links)
- An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- The discrete and mixed minimax 2-center problems (Q2424880) (← links)
- Topological stability of kinetic \(k\)-centers (Q2662690) (← links)
- The Mixed Center Location Problem (Q2958327) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams (Q3452847) (← links)
- On the minimum consistent subset problem (Q5918312) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Intersecting disks using two congruent disks (Q5918623) (← links)
- Covering a set of line segments with a few squares (Q5925557) (← links)
- Intersecting disks using two congruent disks (Q5925580) (← links)
- Covering a set of line segments with a few squares (Q5925680) (← links)
- Covering convex polygons by two congruent disks (Q5970791) (← links)
