On some geometric problems of color-spanning sets
Year of publication: |
2013
|
---|---|
Authors: | Ju, Wenqi ; Fan, Chenglin ; Luo, Jun ; Zhu, Binhai ; Daescu, Ovidiu |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 26.2013, 2, p. 266-283
|
Subject: | computational geometry | color-spanning set | NP complete | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Largest area convex hull of imprecise data based on axis-aligned squares
Ju, Wenqi, (2013)
-
Optimizing the layout of proportional symbol maps : polyhedra and computation
Kunigami, Guilherme, (2014)
-
Solving the geometric firefighter routing problem via integer programming
Zambon, Mauricio J. O., (2019)
- More ...
-
Largest area convex hull of imprecise data based on axis-aligned squares
Ju, Wenqi, (2013)
-
On some geometric problems of color-spanning sets
Ju, Wenqi, (2013)
-
On recovering syntenic blocks from comparative maps
Chen, Zhixiang, (2009)
- More ...