Skip to main content

Spatial Matching

  • Reference work entry
  • First Online:
Encyclopedia of GIS
  • 124 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  • Abraham D, Cechlarova K, Manlove D, Mehlhorn K (2004) Pareto optimality in house allocation problems. Lect Notes Comput Sci 3341:3–15

    Article  MathSciNet  MATH  Google Scholar 

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Burkard RE, Dell’Amico M, Martello S (2009) Assignment problems. Society for Industrial and Applied Mathematics, Philadelphia

    Book  MATH  Google Scholar 

  • Efrat A, Itai A, Katz MJ (2001) Geometry helps in bottleneck matching and related problems. Algorithmica 31(1):1–28

    Article  MathSciNet  MATH  Google Scholar 

  • Gabow HN, Tarjan RE (1988) Algorithms for two bottleneck optimization problems. J Algorithms 9(3): 411–417

    Article  MathSciNet  MATH  Google Scholar 

  • Gale D, Shapley L (1962) College admissions and the stability of marriage. Am Math Mon 69:9–15

    Article  MathSciNet  MATH  Google Scholar 

  • Gross O (1959) The bottleneck assignment problem. The Rand Corporation, Santa Monica

    Google Scholar 

  • Irving RW, Kavitha T, Mehlhorn K, Michail D, Paluch K (2004) Rank-maximal matchings. In: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 68–75

    Google Scholar 

  • Long C, Wong RC-W, Yu PS, Jiang M (2013) On optimal worst-case matching. In: SIGMOD, New York

    Book  Google Scholar 

  • Mehlhorn K (2009) Assigning papers to referees. In: Automata, languages and programming, Rhodes, pp 1–2

    MATH  Google Scholar 

  • Munkres J (1957) Algorithms for the assignment and transportation problems. J Soc Ind Appl Math 5(1):32–38

    Article  MathSciNet  MATH  Google Scholar 

  • U LH, Yiu ML, Mouratidis K, Mamoulis N (2008) Capacity constrained assignment in spatial databases. In: SIGMOD, Vancouver

    Google Scholar 

  • U LH, Mouratidis K, Mamoulis N (2010) Continuous spatial assignment of moving users. VLDB J 19(2):141–160

    Google Scholar 

  • Wong RC-W, Tao Y, Fu AW-C, Xiao X (2007) On efficient spatial matching. In: VLDB, Vienna

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Raymond Chi-Wing Wong .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Wong, R.CW. (2017). Spatial Matching. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_1515

Download citation

Publish with us

Policies and ethics