Capacity Constrained Assignment in Spatial Databases
Summary: Capacity constrained assignment (CCA) in spatial databases: match P to Q with capacities, maximize matches, minimize total distance. Edge-aware pruning based on spatial structure avoids the full distance graph, enabling exact CCA algorithms and approximate methods with theoretical guarantees. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Leong Hou U
- 2. Man Lung Yiu
- 3. Kyriakos Mouratidis
- 4. Nikos Mamoulis
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,071 | Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor | 2009 | VLDB | 7.6120001e-05 |
| 3,235 | Online Minimum Matching in Real-Time Spatial Data: Experiments and Analysis | 2016 | VLDB | 7.3355287e-05 |
| 5,973 | On Optimal Worst-Case Matching | 2013 | SIGMOD | 5.2470655e-05 |
| 7,644 | Feedback-Aware Social Event-Participant Arrangement | 2017 | SIGMOD | 4.6898827e-05 |
| 11,794 | Flexible Online Task Assignment in Real-Time Spatial Data | 2017 | VLDB | 4.1945683e-05 |
| 11,814 | Spatial Crowdsourcing: Challenges, Techniques, and Applications | 2017 | VLDB | 4.1945683e-05 |
| 11,923 | Utility-Aware Social Event-Participant Planning | 2015 | SIGMOD | 4.1945683e-05 |
| 12,351 | A Fair Assignment Algorithm for Multiple Preference Queries | 2009 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032169493 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 24 | The R+-Tree: A Dynamic Index For Multi-Dimensional Objects | 1987 | VLDB | 0.00083378538 |
| 1,768 | Closest Pair Queries in Spatial Databases | 2000 | SIGMOD | 0.00010622873 |
| 2,247 | On Efficient Spatial Matching | 2007 | VLDB | 9.2048219e-05 |
| 7,608 | Clustering Objects on a Spatial Network | 2004 | SIGMOD | 4.6967024e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,145 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS | 4.8179617e-05 |
| 6,814 | Efficient Algorithms for Optimal Location Queries in Road Networks | 2014 | SIGMOD | 4.9185216e-05 |
| 7,608 | Clustering Objects on a Spatial Network | 2004 | SIGMOD | 4.6967024e-05 |
| 3,272 | Progressive Computation of the Min-Dist Optimal-Location Query | 2006 | VLDB | 7.2958583e-05 |
| 8,063 | An Experimental Evaluation of Task Assignment in Spatial Crowdsourcing | 2018 | VLDB | 4.594024e-05 |
| 8,543 | Reliable Diversity-Based Spatial Crowdsourcing by Moving Workers | 2015 | VLDB | 4.4937074e-05 |
| 2,906 | A Scalable Algorithm for Maximizing Range Sum in Spatial Databases | 2012 | VLDB | 7.9350108e-05 |
| 3,235 | Online Minimum Matching in Real-Time Spatial Data: Experiments and Analysis | 2016 | VLDB | 7.3355287e-05 |
| 5,973 | On Optimal Worst-Case Matching | 2013 | SIGMOD | 5.2470655e-05 |
| 2,247 | On Efficient Spatial Matching | 2007 | VLDB | 9.2048219e-05 |