The following pages link to Finding Least-Distances Lines (Q3665109):
Displaying 17 items.
- Line facility location in weighted regions (Q543511) (← links)
- The power of geometric duality revisited (Q1068550) (← links)
- An iterative linear programming solution to the Euclidean regression model (Q1184455) (← links)
- Extending NC and RNC algorithms (Q1263974) (← links)
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- Solving restricted line location problems via a dual interpretation (Q1289029) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Locating hyperplanes to fitting set of points: a general framework (Q1652646) (← links)
- On the complexity of locating linear facilities in the plane (Q1837617) (← links)
- Locating a median line with partial coverage distance (Q2349526) (← links)
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications (Q2367406) (← links)
- Line Facility Location in Weighted Regions (Q3511420) (← links)
- Line Segment Facility Location in Weighted Subdivisions (Q3638446) (← links)
- Approximating finite weighted point sets by hyperplanes (Q5056110) (← links)
- The two-line center problem from a polar view: a new algorithm and data structure (Q5057418) (← links)
- POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA (Q5470166) (← links)
- Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem (Q6601971) (← links)
