Capacity Constrained Assignment in Spatial Databases
Given a point set P of customers (e.g., WiFi receivers) and a point set Q of service providers (e.g., wireless access points), where each q 2 Q has a capacity q.k, the capacity constrained assignment (CCA) is a matching M Q × P such that (i) each point q 2 Q (p 2 P) appears at most k times (at most...
Saved in:
Main Authors: | LEONG, Hou U, YIU, Man Lung, MOURATIDIS, Kyriakos, MAMOULIS, Nikos |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2008
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/412 https://ink.library.smu.edu.sg/context/sis_research/article/1411/viewcontent/SIGMOD08_CCA.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Optimal Matching between Spatial Datasets under Capacity Constraints
by: LEONG, Hou U, et al.
Published: (2010) -
Query Processing in Spatial Databases Containing Obstacles
by: ZHANG, Jun, et al.
Published: (2005) -
Aggregate Nearest Neighbor Queries in Spatial Databases
by: PAPADIAS, Dimitris, et al.
Published: (2005) -
A Fair Assignment Algorithm for Multiple Preference Queries
by: U, Leong Hou, et al.
Published: (2009) -
Continuous Spatial Assignment of Moving Users
by: LEONG, Hou U, et al.
Published: (2010)