Dynamic Products of Ranks

07/16/2020
by   David Eppstein, et al.
0

We describe a data structure that can maintain a dynamic set of points given by their Cartesian coordinates, and maintain the point whose product of ranks within the two coordinate orderings is minimum or maximum, in time O(√(nlog n)) per update.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2021

Dynamic Geometric Set Cover, Revisited

Geometric set cover is a classical problem in computational geometry, wh...
research
03/14/2021

More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time

We study geometric set cover problems in dynamic settings, allowing inse...
research
06/28/2021

Dynamic Connectivity in Disk Graphs

Let S be a set of n sites, each associated with a point in ℝ^2 and a rad...
research
04/04/2023

Dynamic treewidth

We present a data structure that for a dynamic graph G that is updated b...
research
11/03/2020

Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders

We show that the higher dimensional Weierstrass and Ehrlich-Aberth metho...
research
12/13/2019

Construction and Maintenance of Swarm Drones

In this paper we study the dynamic version of the covering problem motiv...
research
02/11/2023

A Simple Data Structure for Maintaining a Discrete Probability Distribution

We revisit the following problem: given a set of indices S = {1, …, n} a...

Please sign up or login with your details

Forgot password? Click here to reset