An Optimal Algorithm for the Maximum Three-Chain Problem

DOI10.1137/0222060MaRDI QIDQ3142588zbMATH OpenOpenAlexFDO

Authors R. D. Lou, Majid Sarrafzadeh

Publication date 4 January 1994

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0222060

zbMATH Keywords

chainscomputational geometrylower boundoptimal algorithmpoint dominance

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• An Optimal Algorithm for the Maximum Two-Chain Problem
• Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
• Computing the all-pairs longest chains in the plane
• An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains
• scientific article; zbMATH DE number 905031

Cited in

(5)

• An efficient algorithm for the three-guard problem
• A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
• An Optimal Algorithm for the Maximum Two-Chain Problem
• scientific article; zbMATH DE number 894762 (Why is no real title available?)
• scientific article; zbMATH DE number 905031 (Why is no real title available?)

This page was built for publication: An Optimal Algorithm for the Maximum Three-Chain Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142588)