1 citations · 4 across the 11 of their papers we have counts for
11 papers
Approximation Algorithms for the Freeze Tag Problem inside Polygons
Fatemeh Rajabi-Alni, Alireza Bagheri, Behrouz Minaei-Bidgoli
The freeze tag problem (FTP) aims to awaken a swarm of robots with one or more initial awake robots as soon as possible. Each awake robot must touch a sleeping robot to wake it up.…
Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm
Fatemeh Rajabi-Alni, Alireza Bagheri
Given two sets A={a_1,a_2,...,a_s} and {b_1,b_2,...,b_t}, a many-to-many matching with demands and capacities (MMDC) between A and B matches each element a_i in A to at least α_i a…
Efficient Many-To-Many Matching of Points with Demands in One Dimension
Fatemeh Rajabi-Alni, Behrouz Minaei-Bidgoli
Given two point sets and , the minimum-cost many-to-many matching with demands (MMD) problem is the problem of finding a minimum-cost many-to-many matching between and $…
A faster algorithm for the limited-capacity many-to-many point matching in one dimension
Fatemeh Rajabi-Alni, Alireza Bagheri, Behrouz Minaei-Bidgoli
Given two sets S and T, a limited-capacity many-to-many matching (LCMM) between S and T matches each element p in S (resp. T) to at least 1 and at most Cap(p) elements in T (resp.…
An O(n^2) algorithm for Many-To-Many Matching of Points with Demands in One Dimension
Fatemeh Rajabi-Alni, Alireza Bagheri
Given two point sets S and T, we study the many-to-many matching with demands problem (MMD problem) which is a generalization of the many-to-many matching problem (MM problem). In…
An time algorithm for the maximum-weight limited-capacity many-to-many matching
Fatemeh Rajabi-Alni, Behrouz Minaei-Bidgoli
Given an undirected bipartite graph , a many-to-many matching (MM) in matches each vertex in (resp. ) to at least one vertex in (resp. ). In…