Locating a Communication Path in a Competitive Scenario
暂无分享,去创建一个
[1] Boris Aronov,et al. On approximating the depth and related problems , 2005, SODA '05.
[2] H. Alt,et al. Computing the depth of an arrangement of axis-aligned rectangles in parallel ∗ , 2010 .
[3] Anita Schöbel,et al. Locating least-distant lines in the plane , 1998, Eur. J. Oper. Res..
[4] Kai Tang,et al. Stabbing Convex Polygons with a Segment or a Polygon , 2008, ESA.
[5] Zvi Drezner,et al. Facility location - applications and theory , 2001 .
[6] Fu Lee Wang,et al. Efficient algorithm for transversal of disjoint convex polygons , 2002, Inf. Process. Lett..
[7] Jorge Urrutia,et al. Bichromatic separability with two boxes: A general approach , 2009, J. Algorithms.
[8] José Miguel Díaz-Báñez,et al. Continuous location of dimensional structures , 2004, Eur. J. Oper. Res..
[9] David Avis,et al. Algorithms for high dimensional stabbing problems , 1990, Discret. Appl. Math..
[10] Atsuyuki Okabe,et al. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.
[11] Frank Plastria,et al. Continuous Location Problems , 1995 .
[12] R. Suganya,et al. Data Mining Concepts and Techniques , 2010 .
[13] Frank Plastria,et al. Static competitive facility location: An overview of optimisation approaches , 2001, Eur. J. Oper. Res..
[14] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[15] Sariel Har-Peled,et al. Separability with Outliers , 2005, ISAAC.
[16] Said Salhi,et al. Facility Location: A Survey of Applications and Methods , 1996 .
[17] Pierre Hansen,et al. Locating Objects in the Plane Using Global Optimization Techniques , 2009, Math. Oper. Res..
[18] I. Ventura,et al. Computing Maximal Islands , 2009 .
[19] Gilbert Laporte,et al. Competitive Location Models: A Framework and Bibliography , 1993, Transp. Sci..
[20] David G. Kirkpatrick,et al. Computing Common Tangents Without a Separating Line , 1995, WADS.
[21] I. G. Gowda,et al. Dynamic Voronoi diagrams , 1983, IEEE Trans. Inf. Theory.
[22] Herbert Edelsbrunner. Finding Transversals for Sets of Simple Geometric Figures , 1985, Theor. Comput. Sci..
[23] Mark H. Overmars,et al. On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..