Similar Elements and Metric Labeling on Complete Graphs

03/21/2018
by   Pedro F. Felzenszwalb, et al.
0

We consider a problem that involves finding similar elements in a collection of sets. The problem is motivated by applications in machine learning and pattern recognition. We formulate the similar elements problem as an optimization and give an efficient approximation algorithm that finds a solution within a factor of 2 of the optimal. The similar elements problem is a special case of the metric labeling problem and we also give an efficient 2-approximation algorithm for the metric labeling problem on complete graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/02/2020

A (Slightly) Improved Approximation Algorithm for Metric TSP

For some ϵ > 10^-36 we give a 3/2-ϵ approximation algorithm for metric T...
research
04/06/2020

A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem

One of the most fundamental results in combinatorial optimization is the...
research
03/16/2018

A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case

Transportation networks frequently employ hub-and-spoke network architec...
research
08/31/2023

A Divide and Conquer Approximation Algorithm for Partitioning Rectangles

Given a rectangle R with area A and a set of areas L={A_1,...,A_n} with ...
research
12/04/2022

Clustering Permutations: New Techniques with Streaming Applications

We study the classical metric k-median clustering problem over a set of ...
research
04/26/2020

An Extension of Plücker Relations with Applications to Subdeterminant Maximization

Given a matrix A and k≥ 0, we study the problem of finding the k× k subm...
research
12/18/2022

Unconstrained Traveling Tournament Problem is APX-complete

We show that the Unconstrained Traveling Tournament Problem (UTTP) is AP...

Please sign up or login with your details

Forgot password? Click here to reset