A volume first maxima-finding algorithm

DOI10.1016/J.TCS.2011.08.013zbMATH Open1233.68217OpenAlexW2108450372MaRDI QIDQ653324FDOQ653324

Authors: Xiangquan Gui, Yuanping Zhang, Xiao-hong Hao, Xuerong Yong 

Publication date: 9 January 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.013

Recommendations

• scientific article; zbMATH DE number 2038886
• LATIN 2004: Theoretical Informatics
• A provably fast linear-expected-time maxima-finding algorithm
• Fast computation of output-sensitive maxima in a word RAM
• Maxima-finding algorithms for multidimensional samples: A two-phase approach

zbMATH Keywords

computational geometrymaximaprobabilistic analysisskyline point

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• On Finding the Maxima of a Set of Vectors
• Title not available (Why is that?)
• On the Average Number of Maxima in a Set of Vectors and Applications
• Title not available (Why is that?)
• A provably fast linear-expected-time maxima-finding algorithm

Cited In (4)

• Title not available (Why is that?)
• Maxima-finding algorithms for multidimensional samples: A two-phase approach
• LATIN 2004: Theoretical Informatics
• The volume algorithm: Producing primal solutions with a subgradient method

This page was built for publication: A volume first maxima-finding algorithm

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