On Finding the Maxima of a Set of Vectors

DOI10.1145/321906.321910zbMath0316.68030OpenAlexW2049864887WikidataQ56081812 ScholiaQ56081812MaRDI QIDQ4077449

No author found.

Publication date: 1975

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321906.321910

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Numerical linear algebra (65F99) Algorithms in computer science (68W99) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to convex and discrete geometry (52-00)

Related Items (only showing first 100 items - show all)

Parallel skyline queries ⋮ On a particular case of the multi-criteria unconstrained optimization problem ⋮ A provably fast linear-expected-time maxima-finding algorithm ⋮ Representation and management of MOEA populations based on graphs ⋮ I/O-efficient 2-d orthogonal range skyline and attrition priority queues ⋮ Computation of spatial skyline points ⋮ Dynamic layers of maxima with applications to dominating queries ⋮ Skyline Computation with Noisy Comparisons ⋮ Records, the maximal layer, and uniform distributions in monotone sets ⋮ Random linear programs with many variables and few constraints ⋮ Specular Sets ⋮ Geometric containment and vector dominance ⋮ Distribution-sensitive algorithms ⋮ New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions ⋮ Efficient optimally lazy algorithms for minimal-interval semantics ⋮ In-place algorithms for computing (Layers of) maxima ⋮ On the representation of the search region in multi-objective optimization ⋮ Carbon-efficient scheduling of flow shops by multi-objective optimization ⋮ An interactive decision support system for the bank courier routing problem ⋮ On finding widest empty curved corridors ⋮ Fast algorithms for computing the diameter of a finite planar set ⋮ From proximity to utility: a Voronoi partition of Pareto optima ⋮ On random cartesian trees ⋮ Representation of the non-dominated set in biobjective discrete optimization ⋮ Scanline algorithms on a grid ⋮ Towards estimating expected sizes of probabilistic skylines ⋮ (Approximate) uncertain skylines ⋮ Generators, extremals and bases of max cones ⋮ K-dominance in multidimensional data: theory and applications ⋮ Multiple voting location and single voting location on trees ⋮ Multiobjective Interacting Particle Algorithm for Global Optimization ⋮ A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times ⋮ Cost-efficiency analysis of weapon system portfolios ⋮ Approximating the Pareto optimal set using a reduced set of objective functions ⋮ An efficient algorithm for the longest common palindromic subsequence problem ⋮ A new method for the detection of protection faults in capability-based protection systems ⋮ Fitting a two-joint orthogonal chain to a point set ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Faster output-sensitive skyline computation algorithm ⋮ Fixed interval scheduling with third‐party machines ⋮ Min‐sum controllable risk problems with concave risk functions of the same value range ⋮ Interval scheduling and colorful independent sets ⋮ On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination ⋮ An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³ ⋮ Computing the vector in the convex hull of a finite set of points having minimal length ⋮ Unnamed Item ⋮ Computing the vertices of tropical polyhedra using directed hypergraphs ⋮ On the \(\mathcal{O}_\beta\)-hull of a planar point set ⋮ Maxima-finding algorithms for multidimensional samples: A two-phase approach ⋮ Representing and Quantifying Rank - Change for the Web Graph ⋮ On the angle restricted nearest neighbor problem ⋮ Searching for empty convex polygons ⋮ Maintenance of configurations in the plane ⋮ Skyline-join query processing in distributed databases ⋮ Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data ⋮ Single-machine scheduling with maintenance activities and rejection ⋮ Comparisons between linear functions can help ⋮ A volume first maxima-finding algorithm ⋮ How to improve a team's position in the FIFA ranking? A simulation study ⋮ A steepest descent method for set optimization problems with set-valued mappings of finite cardinality ⋮ Rectilinear Convex Hull with Minimum Area ⋮ The Agree Concept Lattice for Multidimensional Database Analysis ⋮ Output-sensitive peeling of convex and maximal layers ⋮ Exact exponential algorithms for 3-machine flowshop scheduling problems ⋮ Solving efficiently the 0-1 multi-objective knapsack problem ⋮ On local optima in multiobjective combinatorial optimization problems ⋮ \textsc{MasterMovelets}: discovering heterogeneous movelets for multiple aspect trajectory classification ⋮ Dynamic Planar Range Maxima Queries ⋮ Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems ⋮ On the parallel-decomposability of geometric problems ⋮ On the complexity of strongly connected components in directed hypergraphs ⋮ Top-\(k\) Manhattan spatial skyline queries ⋮ Redundance-free description of partitioned complex systems ⋮ Fast linear expected-time algorithms for computing maxima and convex hulls ⋮ A note on bicriterion programming ⋮ Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations ⋮ Linear space data structures for two types of range search ⋮ Optimizing skyline queries over incomplete data ⋮ Non-dominated sorting methods for multi-objective optimization: review and numerical comparison ⋮ Finding the intersection of two convex polyhedra ⋮ A Computational Perspective of the Role of the Thalamus in Cognition ⋮ Dominant skyline query processing over multiple time series ⋮ THRESHOLD RULES FOR ONLINE SAMPLE SELECTION ⋮ A new approach to the dynamic maintenance of maximal points in a plane ⋮ A quantum adiabatic algorithm for multiobjective combinatorial optimization ⋮ The most-likely skyline problem for stochastic points ⋮ Approximating Distance Measures for the Skyline ⋮ Lower bounds for maximal and convex layers problems ⋮ Sampling-based approximate skyline calculation on big data ⋮ Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs ⋮ Dynamic programming bi-criteria combinatorial optimization ⋮ K-Dominance in Multidimensional Data: Theory and Applications ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works ⋮ Efficient Large-Scale Multi-Drone Delivery using Transit Networks ⋮ On the X-Y convex hull of a set of X-Y polygons ⋮ On the definition and computation of rectilinear convex hulls ⋮ On constant factors in comparison-based geometric algorithms and data structures ⋮ Lower bounds on probabilistic linear decision trees ⋮ Some dynamic computational geometry problems ⋮ Computing efficiently the nondominated subset of a set sum

This page was built for publication: On Finding the Maxima of a Set of Vectors