Advertisement

Computing Maximal Layers of Points in \(E^{f(n)}\)

  • Indranil BanerjeeEmail author
  • Dana Richards
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9644)

Abstract

In this paper we present a randomized algorithm for computing the collection of maximal layers for a point set in \(E^{k}\) (\(k = f(n)\)). The input to our algorithm is a point set \(P = \{p_1,\ldots ,p_n\}\) with \(p_i \in E^{k}\). The proposed algorithm achieves a runtime of \(O\left( kn^{2 - {1 \over \log {k}} + \log _k{\left( 1 + {2 \over {k+1}}\right) }}\log {n}\right) \) when P is a random order and a runtime of \(O(k^2 n^{3/2 + (\log _{k}{(k-1)})/2}\log {n})\) for an arbitrary P. Both bounds hold in expectation. Additionally, the run time is bounded by \(O(kn^2)\) in the worst case. This is the first non-trivial algorithm whose run-time remains polynomial whenever f(n) is bounded by some polynomial in n while remaining sub-quadratic in n for constant k (in expectation). The algorithm is implemented using a new data-structure for storing and answering dominance queries over the set of incomparable points.

Keywords

Maximal layers Random order Complexity 

References

  1. 1.
    Winkler, P.: Random orders. Order 1–4, 317–331 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Brightwell, G.: Random \(k\)-dimensional orders: width and number of linear extensions. Order 9, 333–342 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Jensen, M.T.: Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE TEC 7–5, 503–515 (2003)Google Scholar
  4. 4.
    Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM 22–4, 469–476 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Bentley, J.L., Kung, H.T., Schkolnick, M., Thompson, C.D.: On the average number of maxima in a set of vectors and applications. J. ACM 25–4, 536–543 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Yao, F.F.: On Finding the maximal elements in a set of plane vectors. Computer Science Department of Report, University of Illinois at Urbana-Champaign, Urbana, Illinois (1974)Google Scholar
  7. 7.
    Bentley, J.L.: Multidimensional divide-and-conquer. Commun. ACM 23–4, 214–229 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Preparata, P., Shamos, M.: Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer, Berlin (1985)CrossRefzbMATHGoogle Scholar
  9. 9.
    Overmars, M.H.: The Design of Dynamic Data Structures. LNCS, vol. 156. Springer, New York, Tokyo (1983)zbMATHGoogle Scholar
  10. 10.
    Matoušek, J.: Computing dominance in \(E^n\). Inf. Process. Lett. 38, 277–278 (1991)CrossRefzbMATHGoogle Scholar
  11. 11.
    Impagliazzo, R., Lovett, S., Paturi, R., Schneider, S.: 0–1 Integer Linear Programming with a Linear Number of Constraints, eprint arXiv:1401.5512 (2014)
  12. 12.
    Nielsen, F.: Output-sensitive peeling of convex and maximal layers. Inf. Process. Lett. 59, 255–259 (1996)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceGeorge Mason UniversityFairfaxUSA

Personalised recommendations