AI Chat AI Image Generator AI Video Text to Speech

A Faster Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension

04/04/2019

∙

by Fatemeh Rajabi-Alni, et al.

∙

∙

Given two point sets S and T on a line, we present a linear time algorithm for the limited capacity many-to-many matching between S and T which improves the previous quadratic algorithm.

Fatemeh Rajabi-Alni
3 publications
Alireza Bagheri
14 publications

page 1

page 2

page 3

page 4

research

∙ 04/09/2019

A Fast and Efficient algorithm for Many-To-Many Matching of Points with Demands in One Dimension

Given two point sets S and T, we first study the many-to-many matching w...

0 Fatemeh Rajabi-Alni, et al. ∙

research

∙ 12/31/2020

Matching on the line admits no o(√(log n))-competitive algorithm

We present a simple proof that the competitive ratio of any randomized o...

0 Enoch Peserico, et al. ∙

research

∙ 03/05/2020

Linear-Time Parameterized Algorithms with Limited Local Resources

We propose a new (theoretical) computational model for the study of mass...

0 Jianer Chen, et al. ∙

research

∙ 01/07/2021

Controlling Entity Integrity with Key Sets

Codd's rule of entity integrity stipulates that every table has a primar...

0 Miika Hannula, et al. ∙

research

∙ 03/15/2018

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region

The beacon model is a recent paradigm for guiding the trajectory of mess...

0 Irina Kostitsyna, et al. ∙

research

∙ 08/11/2022

Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching

Motivated by blockchain technology for supply-chain tracing of ethically...

0 Gill Barequet, et al. ∙

research

∙ 11/20/2016

A note about "Faster algorithms for computing Hong's bound on absolute positiveness" by K. Mehlhorn and S. Ray

We show that a linear-time algorithm for computing Hong's bound for posi...

0 Przemysław Koprowski, et al. ∙