Minimum Color Spanning Circle in Imprecise Setup

[1]  Maarten Löffler,et al.  Largest bounding box, smallest diameter, and related problems on imprecise points , 2007, Comput. Geom..

[2]  Sandip Das,et al.  Smallest Color-Spanning Object Revisited , 2009, Int. J. Comput. Geom. Appl..

[3]  Asish Mukhopadhyay,et al.  An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons , 1996, J. Algorithms.

[4]  Jun Luo,et al.  On some geometric problems of color-spanning sets , 2012, Journal of Combinatorial Optimization.

[5]  Rolf Klein,et al.  Smallest Color-Spanning Objects , 2001, ESA.

[6]  Donald E. Knuth,et al.  The Problem of Compatible Representatives , 1992, SIAM J. Discret. Math..

[7]  Leonidas J. Guibas,et al.  Epsilon geometry: building robust algorithms from imprecise computations , 1989, SCG '89.

[8]  Micha Sharir,et al.  The upper envelope of voronoi surfaces and its applications , 1993, Discret. Comput. Geom..

[9]  Jirí Fiala,et al.  Systems of distant representatives , 2005, Discret. Appl. Math..

[10]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[11]  Adrian Dumitrescu,et al.  Dispersion in Disks , 2009, Theory of Computing Systems.

[12]  Mohammad Ali Abam,et al.  Computing the Smallest Color-Spanning Axis-Parallel Square , 2013, ISAAC.

[13]  Jun Luo,et al.  NP-Completeness of Spreading Colored Points , 2010, COCOA.

[14]  Sergio Cabello,et al.  Approximation algorithms for spreading points , 2004, J. Algorithms.

[15]  Maarten Löffler,et al.  The directed Hausdorff distance between imprecise point sets , 2011, Theor. Comput. Sci..

[16]  Haitao Wang,et al.  Shortest Color-Spanning Intervals , 2014, COCOON.

[17]  Moshe Dror,et al.  Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets , 2008, SIAM J. Discret. Math..

[18]  Petrică C. Pop,et al.  The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances , 2020, Eur. J. Oper. Res..

[19]  Rudolf Fleischer,et al.  Computing minimum diameter color-spanning sets is hard , 2011, Inf. Process. Lett..

[20]  R. Manzini,et al.  Design, Management and Control of Logistic Distribution Systems , 2008 .

[21]  Joachim Gudmundsson,et al.  TSP with neighborhoods of varying size , 2005, J. Algorithms.

[22]  Sasanka Roy,et al.  Minimum width color spanning annulus , 2018, Theor. Comput. Sci..

[23]  Anthony K. H. Tung,et al.  Keyword Search in Spatial Databases: Towards Searching by Document , 2009, 2009 IEEE 25th International Conference on Data Engineering.