Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane

DOI10.1007/s10898-023-01280-1zbMath1527.90194arXiv2012.15381OpenAlexW3114075987MaRDI QIDQ6162513

Sergio Cabello

Publication date: 28 June 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.15381

zbMATH Keywords

clusteringgeometric optimizationPareto front\(k\)-centerskyline

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)

Related Items (1)

Efficient \(k\)-center algorithms for planar points in convex position

Cites Work

• Unnamed Item
• Unnamed Item
• Parametric search made practical
• Output-sensitive peeling of convex and maximal layers
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Clustering to minimize the maximum intercluster distance
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• The Design of Approximation Algorithms
• Generalized Selection and Ranking: Sorted Matrices
• A Best Possible Heuristic for the k-Center Problem
• Combinatorial Optimization with Rational Objective Functions
• On Finding the Maxima of a Set of Vectors
• Location Science
• Maximizing dominance in the plane and its applications
• A tutorial on multiobjective optimization: fundamentals and evolutionary methods

This page was built for publication: Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane