Maxima-finding algorithms for multidimensional samples: A two-phase approach

DOI10.1016/j.comgeo.2011.08.001zbMath1243.65032OpenAlexW1985461988MaRDI QIDQ425621

Wei-Mei Chen, Hsien-Kuei Hwang, Tsung-Hsi Tsai

Publication date: 8 June 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.08.001

zbMATH Keywords

algorithmsmulti-objective optimizationnumerical examplesPareto optimalitydominancemaximal pointsgraphical examplesskylinecomputational theory

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

Computing efficiently the nondominated subset of a set sum ⋮ A phase transition for the probability of being a maximum among random vectors with general iid coordinates ⋮ Unnamed Item ⋮ On functional records and champions

Uses Software

• MOEA/D

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification
• Multivariate records based on dominance
• In-place algorithms for computing (Layers of) maxima
• Some algorithms based on the dual of Dilworth's theorem
• Moment inequalities for random variables in computational geometry
• Fast linear expected-time algorithms for computing maxima and convex hulls
• A note on the expected time for finding maxima by list algorithms
• A provably fast linear-expected-time maxima-finding algorithm
• Multicriteria optimization
• Three-dimensional layers of maxima
• Records, the maximal layer, and uniform distributions in monotone sets
• The chain records
• The Longest Chain Among Random Points in Euclidean Space
• Multidimensional binary search trees used for associative searching
• On Finding the Maxima of a Set of Vectors
• On the distribution of the length of the longest increasing subsequence of random permutations
• On random cartesian trees
• Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors
• On a random directed spanning tree
• Exact asymptotics of divide-and-conquer recurrences
• Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Rooted edges of a minimal directed spanning tree on random points
• Maxima in hypercubes
• LATIN 2004: Theoretical Informatics
• Limit theorems for the number of maxima in random samples from planar regions

This page was built for publication: Maxima-finding algorithms for multidimensional samples: A two-phase approach