Rivera, NicolásNicolásRiveraPablo AranedaCarlos Hernández UlloaJorge A. Baier2025-08-252025-08-252024-06-0110.1609/socs.v17i1.315682-s2.0-85196626718https://cris-uv-2.scimago.es/handle/123456789/6063Bi-objective search requires computing a Pareto solution set which contains a set of paths. In real-world applications, Pareto solution sets may contain several tens or even hundreds of solutions. For a human user trying to commit to just one of these paths, navigating through a large solution set may become overwhelming, which motivates the problem of computing small, good-quality subsets of Pareto frontiers. This document presents two main contributions. First, we provide a simple formalization of good-quality subsets of a Pareto solution set. For this, we use measure of richness which has been employed in the study of Population Dynamics. Second, we propose Chebyshev BOA*, a variant of BOA* to compute good-quality subset approximations.enacceso abiertoComputer Networks And Communicationsconference paper