Efficient maxima-finding algorithms for random planar samples

We collect major known algorithms in the literature for finding the maxima of multi-dimensional points and provide a simple classification. Several new algorithms are proposed. In particular, we give a new maxima-finding algorithm with expected complexity n+O(√n\log n) when the input is a sequence of points uniformly chosen at random from general planar regions. We also give a sequential algorithm, very efficient for practical purposes.

[1]  Brian Logan,et al.  State Space Search with Prioritised Soft Constraints , 2004, Applied Intelligence.

[2]  Neelima Gupta,et al.  Distribution-Sensitive Algorithms , 1999, Nord. J. Comput..

[3]  Luc Devroye,et al.  A Note on the Expected Time for Finding Maxima by List Algorithms , 1999, Algorithmica.

[4]  Sergey Bereg,et al.  Rectilinear 2-center problems , 1999, CCCG.

[5]  David G. Kirkpatrick,et al.  Output-size sensitive algorithms for finding maximal vectors , 1985, SCG '85.

[6]  B. Ramakrishna Rau,et al.  PICO: Automatically Designing Custom Computers , 2002, Computer.

[7]  Christian Jost,et al.  Risk assessment of the harvested pike-perch population of the Azov Sea , 2002 .

[8]  Yasuhiko Morimoto,et al.  Interval Finding and Its Application to Data Mining , 1996, ISAAC.

[9]  H. T. Kung,et al.  On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.

[10]  Salvatore Greco,et al.  Rough approximation by dominance relations , 2002, Int. J. Intell. Syst..

[11]  H. T. Kung,et al.  On Finding the Maxima of a Set of Vectors , 1975, JACM.

[12]  Hsien-Kuei Hwang,et al.  On the variance of the number of maxima in random vectors and its applications , 1998 .

[13]  Sanjiv Kapoor.  Dynamic Maintenance of Maxima of 2-d Point Sets , 2000, SIAM J. Comput..

[14]  Andrew Chi-Chih Yao,et al.  A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests , 1994, Inf. Process. Lett..

[15]  Barry O'Neill,et al.  The Number of Outcomes in the Pareto-Optimal Set of Discrete Bargaining Games , 1981, Math. Oper. Res..

[16]  S. S. Ravi,et al.  Path problems in networks with vector-valued edge weights , 1999, Networks.

[17]  Sanjay V. Rajopadhye,et al.  Unbounded knapsack problem: Dynamic programming revisited , 2000, Eur. J. Oper. Res..

[18]  R. S Daruwala.  On Computing the Pareto Optimal Solution Set in a Large Scale Dynamic Network , 2002 .

[19]  Michael Ian Shamos,et al.  Divide and Conquer for Linear Expected Time , 1978, Inf. Process. Lett..

[20]  Luc Devroye.  A Note on the Expected Time Required to Construct the Outer Layer , 1985, Inf. Process. Lett..

[21]  Charles E. Blair,et al.  Random inequality constraint systems with few variables , 1986, Math. Program..

[22]  Mordecai J. Golin,et al.  A provably fast linear-expected-time maxima-finding algorithm , 1994, Algorithmica.

[23]  A. Goswami,et al.  Multiobjective transportation problem with interval cost, source and destination parameters , 1999, Eur. J. Oper. Res..

[24]  Andrew M. Odlyzko.  Search for the maximum of a random walk , 1994, STOC '94.

[25]  Piotr Berman,et al.  Winnowing sequences from a database search , 1999, RECOMB.

[26]  Andrew L. Rukhin,et al.  Admissibility: Survey of a Concept in Progress , 1995 .

[27]  Chung-Kuan Cheng,et al.  Timing optimization for multisource nets: characterization andoptimal repeater insertion , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[28]  E. David Ford,et al.  MULTI-CRITERIA ASSESSMENT OF ECOLOGICAL PROCESS MODELS , 1999 .

[29]  Gary B. Lamont,et al.  Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art , 2000, Evolutionary Computation.

[30]  Kenneth L. Clarkson,et al.  Fast linear expected-time algorithms for computing maxima and convex hulls , 1993, SODA '90.

[31]  Pallab Dasgupta,et al.  Multiobjective heuristic search - an introduction to intelligent search methods for multicriteria optimization , 1999, Computational intelligence.

[32]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[33]  Hsien-Kuei Hwang,et al.  LIMIT THEOREMS FOR THE NUMBER OF MAXIMA IN RANDOM SAMPLES FROM PLANAR REGIONS , 2001 .

[34]  Hiroshi Imai,et al.  Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima , 1998 .

[35]  Charles M. Goldie,et al.  Records in a partially ordered set , 1989 .

[36]  Abraham Wald,et al.  Statistical Decision Functions , 1951 .

[37]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

[38]  忠彦 村田.  First International Conference on Evolutionary Multi-Criterion Optimization (EMO 2001) 報告 , 2001 .

[39]  Hsien-Kuei Hwang,et al.  Berry-Esseen Bounds for the Number of Maxima in Planar Regions , 2003 .

[40]  Mireille Régnier,et al.  Analytic variations on bucket selection and sorting , 2000, Acta Informatica.

[41]  Thomas de Quincey.  [C] , 2000, The Works of Thomas De Quincey, Vol. 1: Writings, 1799–1820.

[42]  Jean-Charles Pomerol,et al.  Multicriterion decision in management , 2000 .

[43]  Luc Devroye,et al.  Lecture Notes on Bucket Algorithms , 1986, Progress in Computer Science.

[44]  Mark H. Overmars,et al.  On the Equivalence of Some Rectangle Problems , 1982, Inf. Process. Lett..

[45]  Gebräuchliche Fertigarzneimittel,et al.  V , 1893, Therapielexikon Neurologie.

[46]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[47]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[48]  Martin Zachariasen,et al.  Rectilinear full Steiner tree generation , 1999, Networks.

[49]  Ralf Hartmut Güting,et al.  Fast Algorithms for Direct Enclosures and Direct Dominances , 1989, J. Algorithms.

[50]  Donald E. Knuth,et al.  Mathematical Analysis of Algorithms , 1971, IFIP Congress.

[51]  Mikhail S. Gelfand,et al.  Recognition of Genes in Human DNA Sequences , 1996, J. Comput. Biol..

[52]  Tiko Kameda,et al.  On the Vector Representation of the Reachability in Planar Directed Graphs , 1975, Inf. Process. Lett..

[53]  C. L. Liu,et al.  An area minimizer for floorplans with L-shaped regions , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[54]  Chung-Kuan Cheng,et al.  Timing optimization for multi-source nets: characterization and optimal repeater insertion , 1997, DAC.

[55]  Kenneth L. Clarkson.  More Output-Sensitive Geometric Algorithms (Extended Abstract) , 1994, FOCS 1994.

[56]  Michael M. Kostreva,et al.  A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks , 2000, RAIRO Oper. Res..

[57]  Alberto Apostolico,et al.  The longest common subsequence problem revisited , 1987, Algorithmica.

[58]  Alfred O. Hero,et al.  Pareto-optimal methods for gene analysis , 2002 .

[59]  E. Polak,et al.  On Multicriteria Optimization , 1976 .

[60]  Charles E. Blair,et al.  Random linear programs with many variables and few constraints , 1986, Math. Program..

[61]  Philippe Flajolet,et al.  Exact Asymptotics of Divide-and-Conquer Recurrences , 1993, ICALP.

[62]  Martin Müller,et al.  Partial order bounding: A new approach to evaluation in game tree search , 2001, Artif. Intell..

[63]  Allan R. Wilks,et al.  Analysis of Data From the Places Rated Almanac , 1987 .

[64]  Dorotea De Luca Cardillo,et al.  A DEA model for the efficiency evaluation of nondominated paths on a road network , 2000, Eur. J. Oper. Res..

[65]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[66]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[67]  Chung-Kuan Cheng,et al.  Timing Optimization For Multi-source Nets: Characterization And Optimal Repeater Insertion , 1997, Proceedings of the 34th Design Automation Conference.

[68]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[69]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[70]  Luc Devroye.  Moment inequalities for random variables in computational geometry , 2005, Computing.