The following pages link to The discrete 2-center problem (Q1272957):
Displaying 32 items.
- Base station placement on boundary of a convex polygon (Q436692) (← links)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- A faster algorithm for the two-center decision problem (Q685492) (← links)
- A fast deterministic smallest enclosing disk approximation algorithm (Q835047) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- A sweepline algorithm to solve the two-center problem (Q1318733) (← links)
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center (Q1405006) (← links)
- Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← links)
- The mixed center location problem (Q1631666) (← links)
- Time-dependent green Weber problem (Q1651568) (← links)
- A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. (Q1853036) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem (Q1969591) (← links)
- Discrete rectilinear 2-center problems (Q1975961) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Efficient planar two-center algorithms (Q2230394) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- The most points connected-covering problem with two disks (Q2322704) (← links)
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments (Q2424732) (← links)
- The discrete and mixed minimax 2-center problems (Q2424880) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- (Q2708487) (← links)
- The 2-center problem with obstacles (Q2777608) (← links)
- Syzygies in the two center problem (Q2805233) (← links)
- Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)
- On clustering to minimize the sum of radii (Q2884573) (← links)
- The Mixed Center Location Problem (Q2958327) (← links)
- Computing a Segment Center for a Planar Point Set (Q3141535) (← links)
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
- The Discrete and Mixed Minimax 2-Center Problem (Q3467837) (← links)
- (Q5688777) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
