On Finding the Maxima of a Set of Vectors

DOI10.1145/321906.321910zbMATH Open0316.68030OpenAlexW2049864887WikidataQ56081812 ScholiaQ56081812MaRDI QIDQ4077449FDOQ4077449

Authors:

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

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

Cited In (only showing first 100 items - show all)

• On random cartesian trees
• A quantum adiabatic algorithm for multiobjective combinatorial optimization
• Faster output-sensitive skyline computation algorithm
• Computation of spatial skyline points
• Dynamic layers of maxima with applications to dominating queries
• I/O-efficient 2-d orthogonal range skyline and attrition priority queues
• On the complexity of strongly connected components in directed hypergraphs
• Finding the intersection of two convex polyhedra
• Interval scheduling and colorful independent sets
• A tutorial on multiobjective optimization: fundamentals and evolutionary methods
• Geometric containment and vector dominance
• On the angle restricted nearest neighbor problem
• On the X-Y convex hull of a set of X-Y polygons
• Parallel skyline queries
• Lower bounds on probabilistic linear decision trees
• On the parallel-decomposability of geometric problems
• On the definition and computation of rectilinear convex hulls
• Searching for empty convex polygons
• Maxima-finding algorithms for multidimensional samples: A two-phase approach
• Generators, extremals and bases of max cones
• Multiple voting location and single voting location on trees
• A volume first maxima-finding algorithm
• Linear space data structures for two types of range search
• In-place algorithms for computing (Layers of) maxima
• Skyline Computation with Noisy Comparisons
• Towards estimating expected sizes of probabilistic skylines
• Fast linear expected-time algorithms for computing maxima and convex hulls
• A provably fast linear-expected-time maxima-finding algorithm
• On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination
• Efficient optimally lazy algorithms for minimal-interval semantics
• On the representation of the search region in multi-objective optimization
• Scanline algorithms on a grid
• Maintenance of configurations in the plane
• A computational perspective of the role of the thalamus in cognition
• Solving efficiently the 0-1 multi-objective knapsack problem
• Computing the vertices of tropical polyhedra using directed hypergraphs
• Fitting a two-joint orthogonal chain to a point set
• Dominant skyline query processing over multiple time series
• Carbon-efficient scheduling of flow shops by multi-objective optimization
• Representation of the non-dominated set in biobjective discrete optimization
• Some dynamic computational geometry problems
• From proximity to utility: a Voronoi partition of Pareto optima
• Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
• Dynamic Planar Range Maxima Queries
• Records, the maximal layer, and uniform distributions in monotone sets
• On finding widest empty curved corridors
• Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
• Random linear programs with many variables and few constraints
• Dynamic programming bi-criteria combinatorial optimization
• Specular sets
• (Approximate) uncertain skylines
• The agree concept lattice for multidimensional database analysis
• Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems
• Rectilinear convex hull with minimum area
• Single-machine scheduling with maintenance activities and rejection
• A note on bicriterion programming
• Representation and management of MOEA populations based on graphs
• Output-sensitive peeling of convex and maximal layers
• How to improve a team's position in the FIFA ranking? A simulation study
• On local optima in multiobjective combinatorial optimization problems
• Approximating the Pareto optimal set using a reduced set of objective functions
• A new approach to the dynamic maintenance of maximal points in a plane
• \textsc{MasterMovelets}: discovering heterogeneous movelets for multiple aspect trajectory classification
• Top-\(k\) Manhattan spatial skyline queries
• On a particular case of the multi-criteria unconstrained optimization problem
• Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data
• Approximating Distance Measures for the Skyline
• Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach
• FlexiBO: A Decoupled Cost-Aware Multi-Objective Optimization Approach for Deep Neural Networks
• Multiobjective interacting particle algorithm for global optimization
• Fast algorithms for computing the diameter of a finite planar set
• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³
• K-Dominance in Multidimensional Data: Theory and Applications
• A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
• Efficient large-scale multi-drone delivery using transit networks
• Exact exponential algorithms for 3-machine flowshop scheduling problems
• An efficient algorithm for the longest common palindromic subsequence problem
• Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane
• On constant factors in comparison-based geometric algorithms and data structures
• A new method for the detection of protection faults in capability-based protection systems
• An interactive decision support system for the bank courier routing problem
• Min‐sum controllable risk problems with concave risk functions of the same value range
• Sampling-based approximate skyline calculation on big data
• Non-dominated sorting methods for multi-objective optimization: review and numerical comparison
• Fixed interval scheduling with third‐party machines
• Rectilinear convex hull of points in 3D and applications
• Representing and Quantifying Rank - Change for the Web Graph
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
• Cost-efficiency analysis of weapon system portfolios
• Comparisons between linear functions can help
• A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times
• K-dominance in multidimensional data: theory and applications
• New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
• Interval finding and its application to data mining
• Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
• Distribution-sensitive algorithms
• Computing the vector in the convex hull of a finite set of points having minimal length
• Title not available (Why is that?)
• Finding algorithm of optimal subset structure based on the Pareto layers in the knapsack problem
• Algorithm for solving the knapsack problem with certain properties of Pareto layers

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

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