Pages that link to "Item:Q4077449"
From MaRDI portal
The following pages link to On Finding the Maxima of a Set of Vectors (Q4077449):
Displaying 50 items.
- Parallel skyline queries (Q269332) (← links)
- Efficient optimally lazy algorithms for minimal-interval semantics (Q313957) (← links)
- On the representation of the search region in multi-objective optimization (Q319674) (← links)
- Carbon-efficient scheduling of flow shops by multi-objective optimization (Q320773) (← links)
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
- Towards estimating expected sizes of probabilistic skylines (Q351025) (← links)
- (Approximate) uncertain skylines (Q359874) (← links)
- Faster output-sensitive skyline computation algorithm (Q402378) (← links)
- Maxima-finding algorithms for multidimensional samples: A two-phase approach (Q425621) (← links)
- Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems (Q511763) (← links)
- On the complexity of strongly connected components in directed hypergraphs (Q517789) (← links)
- Top-\(k\) Manhattan spatial skyline queries (Q522965) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- Approximating the Pareto optimal set using a reduced set of objective functions (Q613484) (← links)
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- A volume first maxima-finding algorithm (Q653324) (← links)
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- Dominant skyline query processing over multiple time series (Q744313) (← links)
- A new approach to the dynamic maintenance of maximal points in a plane (Q751238) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- On the definition and computation of rectilinear convex hulls (Q802314) (← links)
- I/O-efficient 2-d orthogonal range skyline and attrition priority queues (Q827322) (← links)
- Computation of spatial skyline points (Q827323) (← links)
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
- Generators, extremals and bases of max cones (Q869908) (← links)
- Multiple voting location and single voting location on trees (Q877040) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- On the angle restricted nearest neighbor problem (Q910232) (← links)
- Searching for empty convex polygons (Q911758) (← links)
- Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
- On the X-Y convex hull of a set of X-Y polygons (Q1056548) (← links)
- Lower bounds on probabilistic linear decision trees (Q1067786) (← links)
- Some dynamic computational geometry problems (Q1071526) (← links)
- Geometric containment and vector dominance (Q1093914) (← links)
- Fast algorithms for computing the diameter of a finite planar set (Q1104078) (← links)
- Scanline algorithms on a grid (Q1111020) (← links)
- A new method for the detection of protection faults in capability-based protection systems (Q1136495) (← links)
- On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination (Q1140425) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- Comparisons between linear functions can help (Q1170029) (← links)
- On the parallel-decomposability of geometric problems (Q1194344) (← links)
- Redundance-free description of partitioned complex systems (Q1206148) (← links)
- Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
- Finding the intersection of two convex polyhedra (Q1253450) (← links)
- A provably fast linear-expected-time maxima-finding algorithm (Q1329142) (← links)
- On the \(\mathcal{O}_\beta\)-hull of a planar point set (Q1699299) (← links)
- Skyline-join query processing in distributed databases (Q1712432) (← links)
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
