Mathematical Programming Algorithms for Spatial Cloaking

Published Online:https://doi.org/10.1287/ijoc.2018.0813

References

  • Achterberg T (2009) SCIP: Solving constraint integer programs. Math. Programming Comput. 1(1):1–41.CrossrefGoogle Scholar
  • Ardagna CA, Cremonini M, De Capitani di Vimercati S, Samarati P (2011) An obfuscation-based approach for protecting location privacy. IEEE Trans. Dependable Secure Comput. 8(1):13–27.CrossrefGoogle Scholar
  • Boykov Y, Kolmogorov V (2004) An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Analysis Machine Intelligence 26(9):1124–1137.Google Scholar
  • Cherkassky BV, Goldberg AV (1997) On implementing push-relabel method for the maximum flow problem. Algorithmica 19(4):390–410.CrossrefGoogle Scholar
  • Chopra S, Gorres ER, Rao MR (1992) Solving a Steiner tree problem on a graph using branch and cut. ORSA J. Comput. 4(3):320–335.LinkGoogle Scholar
  • Christin D, Reinhardt A, Kanhere SlS, Hollick M (2011) A survey on privacy in mobile participatory sensing applications. J. Systems Software 84(11):1928–1946.CrossrefGoogle Scholar
  • Damiani ML (2014) Location privacy models in mobile applications: Conceptual view and research directions. GeoInformatica 18(4):819–842.CrossrefGoogle Scholar
  • Damiani ML, Bertino E, Silvestri C (2008) Protecting location privacy through semantics-aware obfuscation techniques. Karabulut Y, Mitchell J, Herrmann P, Jensen CD, eds. Trust Management II—Proc. IFIPTM 2008: Joint iTrust PST Conf. Privacy, Trust Management Security, Trondheim, Norway (Springer, Boston), 231–245.Google Scholar
  • Damiani ML, Bertino E, Silvestri C (2010) The PROBE framework for the personalized cloaking of private locations. Trans. Data Privacy 3(2):123–148.Google Scholar
  • Damiani ML, Silvestri C, Bertino E (2011) Fine-grained cloaking of sensitive positions in location-sharing applications. IEEE Pervasive Comput. 10(4):64–72.CrossrefGoogle Scholar
  • Ghinita G (2013) Privacy for Location-Based Services, Morgan (Claypool Publishers, San Rafael, CA).CrossrefGoogle Scholar
  • Koch T, Martin A (1998) Solving Steiner tree problems in graphs to optimality. Networks 32(3):207–232.CrossrefGoogle Scholar
  • Krumm J (2009) A survey of computational location privacy. Personal Ubiquitous Comput. 13(6):391–399.CrossrefGoogle Scholar
  • Lee B, Oh J, Yu H, Kim J (2011) Protecting location privacy using location semantics. Ghosh J, Smyth P, eds. Proc. 17th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 1289–1297.Google Scholar
  • Ljubić I, Weiskircher R, Pferschy U, Klau GW, Mutzel P, Fischetti M (2006) An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math. Programming105(2–3):427–449.CrossrefGoogle Scholar
  • Mathematical Programming Algorithms for Spatial Cloaking (2016) Companion website. Accessed August 1, 2018, http://homes.di.unimi.it/ceselli/GSTP.Google Scholar
  • Pan X, Chen W, Wu L, Piao C, Hu Z (2016) Protecting personalized privacy against sensitivity homogeneity attacks over road networks in mobile services. Frontiers Comput. Sci. 10(2):370–386.CrossrefGoogle Scholar
  • Puttaswamy KPNet al.. (2014) Preserving location privacy in geosocial applications. IEEE Trans. Mobile Comp. 13(1):159–173.CrossrefGoogle Scholar
  • Shokri R, Theodorakopoulos G, Le Boudec J-Y, Hubaux JP (2011) Quantifying location privacy. IEEE Sympos. Security Privacy, Berkeley, CA, 247–262.Google Scholar
  • Song S, Zou Z, Liu K (2016) Semantic-aware location privacy preservation on road networks. Proc. Internat. Conf. Database Systems Adv. Appl., Dallas, 314–331.Google Scholar
  • R Foundation, The (2018) The R project for statistical computing. Accessed July 1, 2016, https://www.r-project.org.Google Scholar
  • van Laarhoven JW (2010) Exact and heuristic algorithms for the Euclidean Steiner tree problem. Thesis, University of Iowa, Iowa City.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.