View Document Preview and Link Document Date: 2014-06-20 16:02:46 Open Document File Size: 315,91 KB Share Result on Facebook
City Eindhoven / Berlin / Toronto / Halifax / New York / / Company Geometric Spanner Networks / Intel / / Country Netherlands / Brazil / / Currency PEN / / / Facility Institute of Computing / Optimization Studio / University of Campinas / / IndustryTerm Greedy randomized adaptive search procedures / latter solutions / local search phase / simulated annealing algorithm / feasible solution / approximation algorithm / enumeration algorithms / partial solution / local search / distinct solutions / nice visualization tool / basic grasp algorithm / mdtp solutions / heuristic solution / search tree / valid primal solution / branch-and-bound algorithm / short computing time / grasp solution / arbitrary integer solution / incumbent solution / primal solutions / wireless networks / primal solution / / OperatingSystem Ubuntu / / Organization University of Campinas / Campinas / Freie Univ. / CGAL Editorial Board / Institute of Computing / US Federal Reserve / Cambridge Univ. / Text Organization / / Person Cid C. de Souza / Graph Drawing / Pedro J. de Rezende / / / Position correspondent / integer programming model for the mdtp / candidate for removal / / ProvinceOrState Nova Scotia / New York / / Technology simulated annealing algorithm / RAM / basic grasp algorithm / proposed algorithm / approximation algorithm / GPS / enumeration algorithms / branch-and-bound algorithm / two algorithms / / URL www.ic.unicamp.br/∼cid / / SocialTag 
CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Minimum Dilation Triangulation: Reaching Optimality Efficiently Al´ex F. Brandt∗ Miguel M. Gaiowski∗