{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T23:45:57Z","timestamp":1695685557627},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,9]],"date-time":"2014-02-09T00:00:00Z","timestamp":1391904000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10732-014-9237-2","type":"journal-article","created":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T07:20:48Z","timestamp":1391844048000},"page":"189-209","source":"Crossref","is-referenced-by-count":4,"title":["Approximated algorithms for the minimum dilation triangulation problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Maria Gisela","family":"Dorz\u00e1n","sequence":"first","affiliation":[]},{"given":"Mario Guillermo","family":"Leguizam\u00f3n","sequence":"additional","affiliation":[]},{"given":"Efr\u00e9n","family":"Mezura-Montes","sequence":"additional","affiliation":[]},{"given":"Gregorio","family":"Hern\u00e1ndez-Pe\u00f1alver","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,9]]},"reference":[{"key":"9237_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E Aarts","year":"1997","unstructured":"Aarts, E., Lenstra, J.: Local Search in Combinatorial Optimization. Wiley, New York (1997)"},{"key":"9237_CR2","volume-title":"Experimental Research in Evolutionary Computation: The New Experimentalism (Natural Computing Series)","author":"T Bartz-Beielstein","year":"2006","unstructured":"Bartz-Beielstein, T.: Experimental Research in Evolutionary Computation: The New Experimentalism (Natural Computing Series). Springer-Verlag New York Inc., Secaucus (2006)"},{"key":"9237_CR3","doi-asserted-by":"crossref","unstructured":"Bartz-Beielstein, T.: SPOT: an R package for automatic and interactive tuning of optimization algorithms by sequential parameter optimization. CoRR (2010)","DOI":"10.1007\/978-3-642-02538-9_14"},{"key":"9237_CR4","doi-asserted-by":"crossref","unstructured":"Beirouti, R., Snoeyink, J.: Implementations of the LMT heuristic for minimum weight triangulation. In: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, SCG \u201998, pp. 96\u2013105. ACM, New York (1998)","DOI":"10.1145\/276884.276895"},{"issue":"11","key":"9237_CR5","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1109\/71.735954","volume":"9","author":"V Bokka","year":"1998","unstructured":"Bokka, V., Gurla, H.: Constant-time algorithms for constrained triangulations on reconfigurable meshes. IEEE Trans. Parallel Distrib. Syst. 9(11), 1057\u20131072 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9237_CR6","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovic, L.: The stretch factor of $$l_{1}$$ l 1 - and $$l_{inf}$$ l i n f -delaunay triangulations. CoRR abs\/1202.5127 (2012)"},{"key":"9237_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V \u010cern\u00fd","year":"1985","unstructured":"\u010cern\u00fd, V.: Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45, 41\u201351 (1985)","journal-title":"J. Optim. Theory Appl."},{"key":"9237_CR8","unstructured":"Chen, Q., Medioni, G.: Image synthesis from a sparse set of views. In: Proceedings of the 8th Conference on Visualization \u201997, VIS \u201997, p. 269-ff. IEEE Computer Society Press (1997)"},{"key":"9237_CR9","unstructured":"Cheong, O., Haverkort, H., Lee, M.: Computing a minimum-dilation spanning tree is NP-hard. In: Proceedings of the Thirteenth Australasian Symposium on Theory of Computing, CATS \u201907, vol. 65, pp. 15\u201324 (2007)"},{"key":"9237_CR10","doi-asserted-by":"crossref","unstructured":"Chew, P.: There is a planar graph almost as good as the complete graph. In: Proceedings of the Second Annual Symposium on Computational Geometry, SCG \u201986, pp. 169\u2013177. ACM, New York (1986)","DOI":"10.1145\/10515.10534"},{"key":"9237_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer-Verlag, Heidelberg (2000)","edition":"2"},{"key":"9237_CR12","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"9237_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut. Comput. 1(1), 3\u201318 (2011)","journal-title":"Swarm Evolut. Comput."},{"issue":"4","key":"9237_CR14","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D Dobkin","year":"1990","unstructured":"Dobkin, D., Friedman, S., Supowit, K.: Delaunay graphs are almost as good as complete graphs. Discret. Comput. Geom. 5(4), 399\u2013407 (1990)","journal-title":"Discret. Comput. Geom."},{"key":"9237_CR15","unstructured":"Drysdale, R., Rote, G., Aichholzer, O.: A simple linear time greedy triangulation algorithm for uniformly distributed points. In: Report IIG-408, Institutes for Information Processing, Technische Universit at Graz (1995)"},{"issue":"1","key":"9237_CR16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Progr. 1(1), 127\u2013136 (1971)","journal-title":"Math. Progr."},{"key":"9237_CR17","unstructured":"Eppstein, D.: Dilation-free planar graphs. http:\/\/www.ics.uci.edu\/~eppstein\/junkyard\/dilation-free\/ (1997). Accessed 4 Feb 2014"},{"key":"9237_CR18","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/B978-044482537-7\/50010-3","volume-title":"Handbook of Computational Geometry","author":"D Eppstein","year":"2000","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier, Amsterdam (2000)"},{"key":"9237_CR19","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Wortman, K.: Minimum dilation stars. In: Proceedings of the 21st ACM Symposium on Computational Geometry, pp. 321\u2013326, cs.CG\/0412025. ACM (2005)","DOI":"10.1145\/1064092.1064142"},{"key":"9237_CR20","unstructured":"Giannopoulos, P., Knauer, C., Marx, D.: Minimum-dilation tour (and path) is NP-hard. In: EWCG 07: Proceedings of the 23rd European Workshop on Computational Geometry, pp. 18\u201321 (2007)"},{"key":"9237_CR21","first-page":"47","volume-title":"LNCS","author":"J Keil","year":"1989","unstructured":"Keil, J., Gutwin, C.: The delaunay triangulation closely approximates the complete euclidean graph. In: Dehne, F., Sack, J.R., Santoro, N. (eds.) LNCS, vol. 382, pp. 47\u201356. Springer, Berlin (1989)"},{"issue":"1","key":"9237_CR22","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J Keil","year":"1992","unstructured":"Keil, J., Gutwin, C.: Classes of graphs which approximate the complete euclidean graph. Discret. Comput. Geom. 7(1), 13\u201328 (1992)","journal-title":"Discret. Comput. Geom."},{"key":"9237_CR23","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"9237_CR24","unstructured":"Klein, A.: Effiziente berechnung einer dilationsminimalen triangulierung. PhD thesis (2006a)"},{"key":"9237_CR25","unstructured":"Klein, A.: Minimum dilation triangulation. Geometry Lab. http:\/\/www.geometrylab.de\/ (2006b). Accessed 4 Feb 2014"},{"key":"9237_CR26","first-page":"556","volume-title":"Graph Drawing","author":"R Klein","year":"2006","unstructured":"Klein, R., Kutz, M.: Computing geometric minimum-dilation graphs is NP-hard. In: Kaufmann, M., Wagner, D. (eds.) Graph Drawing, pp. 556\u2013567. Springer, Berlin (2006)"},{"key":"9237_CR27","unstructured":"Knauer, C., Mulzer, W.: An exclusion region for minimum dilation triangulations. In: EuroCG, Technische Universiteit Eindhoven, pp. 33\u201336 (2005a)"},{"key":"9237_CR28","unstructured":"Knauer, C., Mulzer, W.: Minimum dilation triangulations. In: Freie Universitt Berlin, Fachbereich Mathematik und Informatik, Technical Report (2005b)"},{"issue":"6","key":"9237_CR29","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/s003710100125","volume":"17","author":"I Kolingerov\u00e1","year":"2001","unstructured":"Kolingerov\u00e1, I., Ferko, A.: Multicriteria-optimized triangulations. Vis. Comput. 17(6), 380\u2013395 (2001)","journal-title":"Vis. Comput."},{"key":"9237_CR30","first-page":"321","volume-title":"Iterated Local Search","author":"H Lourenco","year":"2002","unstructured":"Lourenco, H., Martin, O., St\u00fctzle, T.: Iterated Local Search, pp. 321\u2013353. Kluwer Academic Publishers, Norwell (2002)"},{"key":"9237_CR31","first-page":"1127","volume":"6","author":"M Markatou","year":"2005","unstructured":"Markatou, M., Tian, H., Biswas, S., Hripcsak, G.: Analysis of variance of cross-validation estimators of the generalization error. J. Mach. Learn. Res. 6, 1127\u20131168 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"9237_CR32","first-page":"299","volume":"5","author":"O Martin","year":"1991","unstructured":"Martin, O., Otto, S., Felten, E.: Large-step Markov chains for the traveling salesman problem. Complex Syst. 5, 299\u2013326 (1991)","journal-title":"Complex Syst."},{"key":"9237_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to Solve It: Modern Heuristics","author":"Z Michalewicz","year":"2004","unstructured":"Michalewicz, Z., Fogel, D.: How to Solve It: Modern Heuristics. Springer, Berlin (2004)"},{"key":"9237_CR34","first-page":"2000","volume":"30","author":"G Narasimhan","year":"1999","unstructured":"Narasimhan, G., Smid, M.: Approximating the stretch factor of euclidean graphs. SIAM J. Comput. 30, 2000 (1999)","journal-title":"SIAM J. Comput."},{"key":"9237_CR35","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, New York (2007)"},{"key":"9237_CR36","unstructured":"Nielson, G.: Tools for triangulations and tetrahedrizations. In: Scientific Visualization, Overviews, Methodologies, and Techniques, IEEE Computer Society, pp. 429\u2013525 (1997)"},{"key":"9237_CR37","unstructured":"Papadimitriou, C.: The complexity of combinatorial optimization problems. PhD thesis, Princeton, NJ, aAI7704795 (1976)"},{"key":"9237_CR38","first-page":"330","volume-title":"Applications of Evolutionary Computing. Lecture Notes in Computer Science","author":"I Vite-Silva","year":"2007","unstructured":"Vite-Silva, I., Cruz-Cort\u00e9s, N., Toscano-Pulido, G., Fraga, L.: Optimal triangulation in 3d computer vision using a multi-objective evolutionary algorithm. In: Giacobini, M. (ed.) Applications of Evolutionary Computing. Lecture Notes in Computer Science, vol. 4448, pp. 330\u2013339. Springer, Berlin (2007)"},{"key":"9237_CR39","doi-asserted-by":"crossref","unstructured":"Xia, G.: Improved upper bound on the stretch factor of delaunay triangulations. In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry, SoCG \u201911, pp. 264\u2013273. ACM, New York (2011)","DOI":"10.1145\/1998196.1998235"},{"key":"9237_CR40","doi-asserted-by":"crossref","unstructured":"Xia, G., Zhang, L.: Improved lower bound for the stretch factor of delaunay triangulations manuscript. Poster in fwcg10: 20th Annual Fall Workshop on Computational Geometry (2010)","DOI":"10.1145\/1998196.1998235"},{"key":"9237_CR41","unstructured":"Zhou, H., Wu, H., Xia, S., Jin, M., Ding, N.: A distributed triangulation algorithm for wireless sensor networks on 2d and 3d surface. In: INFOCOM, 2011 Proceedings IEEE, pp. 1053\u20131061 (2011)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9237-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9237-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9237-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T03:20:26Z","timestamp":1648264826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9237-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,9]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9237"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9237-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,9]]}}}