Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem

by   Magnus Lie Hetland, et al.

In metric search, worst-case analysis is of little value, as the search invariably degenerates to a linear scan for ill-behaved data. Consequently, much effort has been expended on more nuanced descriptions of what performance might in fact be attainable, including heuristic baselines like the AESA family, as well as statistical proxies such as intrinsic dimensionality. This paper gets to the heart of the matter with an exact characterization of the best performance actually achievable for any given data set and query. Specifically, linear-time objective-preserving reductions are established in both directions between optimal metric search and the minimum dominating set problem, whose greedy approximation becomes the equivalent of an oracle-based AESA, repeatedly selecting the pivot that eliminates the most of the remaining points. As an illustration, the AESA heuristic is adapted to downplay the role of previously eliminated points, yielding some modest performance improvements over the original, as well as its younger relative iAESA2.



There are no comments yet.


page 1

page 2

page 3

page 4


A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph

Given a graph G=(V,E) and an integer k ≥ 1, a k-hop dominating set D of ...

On the vertices belonging to all, some, none minimum dominating set

We characterize the vertices belonging to all minimum dominating sets, t...

Greedy domination on biclique-free graphs

The greedy algorithm for approximating dominating sets is a simple metho...

Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set

A connected dominating set is a widely adopted model for the virtual bac...

Classification Using Proximity Catch Digraphs (Technical Report)

We employ random geometric digraphs to construct semi-parametric classif...

Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function

The Minimum Weight Dominating Set (MWDS) problem is an important general...

Heuristics for k-domination models of facility location problems in street networks

We present new greedy and beam search heuristic methods to find small-si...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.