A linear-time algorithm for linear \(L_ 1\) approximation of points

DOI10.1007/BF01553880zbMath0664.68044MaRDI QIDQ1115605

Kenji Kato, Peter Yamamoto, Hiroshi Imai

Publication date: 1989

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

computational geometrylinear \(L_ 1\) approximationmodified pruning technique

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Computing methodologies and applications (68U99)

Related Items (4)

Continuous location of dimensional structures. ⋮ Line facility location in weighted regions ⋮ POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA ⋮ Line Segment Facility Location in Weighted Subdivisions

Cites Work

• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear-time algorithm for linear \(L_ 1\) approximation of points