Efficient algorithms for optimization problems involving distances in a point set

11/03/2021
by   Matthew J. Katz, et al.
0

We present a general technique, based on parametric search with some twist, for solving a variety of optimization problems on a set of points in the plane or in higher dimensions. These problems include (i) the reverse shortest path problem in unit-disk graphs, recently studied by Wang and Zhao, (ii) the same problem for weighted unit-disk graphs, with a decision procedure recently provided by Wang and Xue, (iii) extensions of these problems to three and higher dimensions, (iv) the discrete Fréchet distance with one-sided shortcuts in higher dimensions, extending the study by Ben Avraham et al., and (v) the maximum-height independent towers problem, in which we want to erect vertical towers of maximum height over a 1.5-dimensional terrain so that no pair of tower tips are mutually visible. We obtain significantly improved solutions for problems (i) and (ii), and new efficient solutions to problems (iii), (iv) and (v), which do not appear to have been studied earlier.

READ FULL TEXT

page 1

page 2

page 4

page 10

page 11

page 12

research
06/01/2023

Improved Algorithms for Distance Selection and Related Problems

In this paper, we propose new techniques for solving geometric optimizat...
research
07/27/2023

The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs

We study the reverse shortest path problem on disk graphs in the plane. ...
research
10/26/2018

Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics

Simple heuristics often show a remarkable performance in practice for op...
research
09/08/2022

Quantum optimization with arbitrary connectivity using Rydberg atom arrays

Programmable quantum systems based on Rydberg atom arrays have recently ...
research
09/09/2017

Homotheties and incidences

We consider problems involving rich homotheties in a set S of n points i...
research
09/28/2018

On Locality-Sensitive Orderings and their Applications

For any constant d and parameter ε > 0, we show the existence of (roughl...
research
05/17/2023

New and improved bounds on the contextuality degree of multi-qubit configurations

We present algorithms and a C code to decide quantum contextuality and e...

Please sign up or login with your details

Forgot password? Click here to reset