Database Paper Browser

Back to papers

On Optimal Worst-Case Matching

Summary: Proposes SPM-MM, a new spatial-matching problem to minimize the maximum assignment distance under provider capacity and customer demand. Threshold-Adapt and Swap-Chain are proposed; Swap-Chain is faster and memory-efficient, with experiments validating scalability. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4728
Venue
SIGMOD
Year
2013
Pagerank
5.2470655e-05
Overall Rank
5,973 | 58.45%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
10,670 X-Blossom: Massive Parallelization of Graph Maximum Matching 2025 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
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
601 Influence Sets Based on Reverse Nearest Neighbor Queries 2000 SIGMOD 0.00019375875
2,085 Capacity Constrained Assignment in Spatial Databases 2008 SIGMOD 9.5804907e-05
2,247 On Efficient Spatial Matching 2007 VLDB 9.2048219e-05
3,071 Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor 2009 VLDB 7.6120001e-05
Previous Page 1 / 1 Next

Semantically Similar Papers