A QUASI-POLYNOMIAL TIME APPROXIMATION SCHEME FOR MINIMUM WEIGHT TRIANGULATION JAN REMY AND ANGELIKA STEGER - Angelika - Document - PDFSEARCH.IO

First Page	Meta Content
	A QUASI-POLYNOMIAL TIME APPROXIMATION SCHEME FOR MINIMUM WEIGHT TRIANGULATION JAN REMY AND ANGELIKA STEGER Add to Reading List Document Date: 2007-08-20 05:29:08 Open Document File Size: 466,52 KB Share Result on Facebook City Eppstein / Bern / / Company H. / / / IndustryTerm quasi-polynomial time algorithm / Polynomial time algorithms / approximation algorithm / greedy algorithm / approximation algorithms / / Organization QUASI-POLYNOMIAL TIME APPROXIMATION SCHEME FOR MINIMUM WEIGHT TRIANGULATION JAN REMY AND ANGELIKA STEGER Institut f¨ / / Person ANGELIKA STEGER / JAN REMY / / PublishedMedium Theory of Computing / / Technology greedy algorithm / approximation algorithms / 3 time algorithm / Polynomial time algorithms / approximation algorithm / quasi-polynomial time algorithm / 8 algorithm / / SocialTag Topology Delaunay triangulation Convex hull Minimum-weight triangulation Pseudotriangle Area Point set triangulation Pitteway triangulation Triangulation Geometry

A QUASI-POLYNOMIAL TIME APPROXIMATION SCHEME FOR MINIMUM WEIGHT TRIANGULATION JAN REMY AND ANGELIKA STEGERAdd to Reading List