Optimal Matching between Spatial Datasets under Capacity Constraints

Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The capacity constrained assignment (CCA) is a matching bet...

Full description

Saved in:
Bibliographic Details
Main Authors: LEONG, Hou U, MOURATIDIS, Kyriakos, YIU, Man Lung, MAMOULIS, Nikos
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2010
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/206
https://ink.library.smu.edu.sg/context/sis_research/article/1205/viewcontent/TODS10_CCA.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-1205
record_format dspace
spelling sg-smu-ink.sis_research-12052020-01-12T13:13:56Z Optimal Matching between Spatial Datasets under Capacity Constraints LEONG, Hou U MOURATIDIS, Kyriakos YIU, Man Lung MAMOULIS, Nikos Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The capacity constrained assignment (CCA) is a matching between the two sets such that (i) each customer is assigned to at most one provider, (ii) every provider serves no more customers than its capacity, (iii) the maximum possible number of customers are served, and (iv) the sum of Euclidean distances within the assigned provider-customer pairs is minimized. Although max-flow algorithms are applicable to this problem, they require the complete distance-based bipartite graph between the customer and provider sets. For large spatial datasets, this graph is expensive to compute and it may be too large to fit in main memory. Motivated by this fact, we propose efficient algorithms for optimal assignment that employ novel edge-pruning strategies, based on the spatial properties of the problem. Additionally, we develop incremental techniques that maintain an optimal assignment (in the presence of updates) with a processing cost several times lower than CCA re-computation from scratch. Finally, we present approximate (i.e., suboptimal) CCA solutions that provide a tunable trade-off between result accuracy and computation cost, abiding by theoretical quality guarantees. A thorough experimental evaluation demonstrates the efficiency and practicality of the proposed techniques. 2010-04-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/206 info:doi/10.1145/1735886.1735888 https://ink.library.smu.edu.sg/context/sis_research/article/1205/viewcontent/TODS10_CCA.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Optimal Assignment Spatial Databases Databases and Information Systems Numerical Analysis and Scientific Computing
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Optimal Assignment
Spatial Databases
Databases and Information Systems
Numerical Analysis and Scientific Computing
spellingShingle Optimal Assignment
Spatial Databases
Databases and Information Systems
Numerical Analysis and Scientific Computing
LEONG, Hou U
MOURATIDIS, Kyriakos
YIU, Man Lung
MAMOULIS, Nikos
Optimal Matching between Spatial Datasets under Capacity Constraints
description Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The capacity constrained assignment (CCA) is a matching between the two sets such that (i) each customer is assigned to at most one provider, (ii) every provider serves no more customers than its capacity, (iii) the maximum possible number of customers are served, and (iv) the sum of Euclidean distances within the assigned provider-customer pairs is minimized. Although max-flow algorithms are applicable to this problem, they require the complete distance-based bipartite graph between the customer and provider sets. For large spatial datasets, this graph is expensive to compute and it may be too large to fit in main memory. Motivated by this fact, we propose efficient algorithms for optimal assignment that employ novel edge-pruning strategies, based on the spatial properties of the problem. Additionally, we develop incremental techniques that maintain an optimal assignment (in the presence of updates) with a processing cost several times lower than CCA re-computation from scratch. Finally, we present approximate (i.e., suboptimal) CCA solutions that provide a tunable trade-off between result accuracy and computation cost, abiding by theoretical quality guarantees. A thorough experimental evaluation demonstrates the efficiency and practicality of the proposed techniques.
format text
author LEONG, Hou U
MOURATIDIS, Kyriakos
YIU, Man Lung
MAMOULIS, Nikos
author_facet LEONG, Hou U
MOURATIDIS, Kyriakos
YIU, Man Lung
MAMOULIS, Nikos
author_sort LEONG, Hou U
title Optimal Matching between Spatial Datasets under Capacity Constraints
title_short Optimal Matching between Spatial Datasets under Capacity Constraints
title_full Optimal Matching between Spatial Datasets under Capacity Constraints
title_fullStr Optimal Matching between Spatial Datasets under Capacity Constraints
title_full_unstemmed Optimal Matching between Spatial Datasets under Capacity Constraints
title_sort optimal matching between spatial datasets under capacity constraints
publisher Institutional Knowledge at Singapore Management University
publishDate 2010
url https://ink.library.smu.edu.sg/sis_research/206
https://ink.library.smu.edu.sg/context/sis_research/article/1205/viewcontent/TODS10_CCA.pdf
_version_ 1770570338665496576