Obtaining Approximately Optimal and Diverse Solutions via Dispersion

by   Jie Gao, et al.

There has been a long-standing interest in computing diverse solutions to optimization problems. Motivated by reallocation of governmental institutions in Sweden, in 1995 J. Krarup posed the problem of finding k edge-disjoint Hamiltonian Circuits of minimum total weight, called the peripatetic salesman problem (PSP). Since then researchers have investigated the complexity of finding diverse solutions to spanning trees, paths, vertex covers, matchings, and more. Unlike the PSP that has a constraint on the total weight of the solutions, recent work has involved finding diverse solutions that are all optimal. However, sometimes the space of exact solutions may be too small to achieve sufficient diversity. Motivated by this, we initiate the study of obtaining sufficiently-diverse, yet approximately-optimal solutions to optimization problems. Formally, given an integer k, an approximation factor c, and an instance I of an optimization problem, we aim to obtain a set of k solutions to I that a) are all c approximately-optimal for I and b) maximize the diversity of the k solutions. Finding such solutions, therefore, requires a better understanding of the global landscape of the optimization function. We show that, given any metric on the space of solutions, and the diversity measure as the sum of pairwise distances between solutions, this problem can be solved by combining ideas from dispersion and multicriteria optimization. We first provide a general reduction to an associated budget-constrained optimization (BCO) problem, where one objective function is to be maximized (minimized) subject to a bound on the second objective function. We then prove that bi-approximations to the BCO can be used to give bi-approximations to the diverse approximately optimal solutions problem with a little overhead.


page 1

page 3

page 5

page 7

page 15

page 17

page 19

page 21


Finding Diverse Trees, Paths, and More

Mathematical modeling is a standard approach to solve many real-world pr...

Finding Diverse Minimum s-t Cuts

Recently, many studies have been devoted to finding diverse solutions in...

How to Fill the Optimum Set? Population Gradient Descent with Harmless Diversity

Although traditional optimization methods focus on finding a single opti...

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems

Finding a single best solution is the most common objective in combinato...

Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax

The evolutionary diversity optimization aims at finding a diverse set of...

FPT Algorithms for Diverse Collections of Hitting Sets

In this work, we study the d-Hitting Set and Feedback Vertex Set problem...

A branch and bound technique for finding the minimal solutions of the linear optimization problems subjected to Lukasiewicz

In this paper, an optimization model with a linear objective function su...

Please sign up or login with your details

Forgot password? Click here to reset