Lower Bounds For Kinetic Planar Subdivisions Pankaj K. Agarwaly Julien Baschz Mark de Bergx John Hershbergerk

First Page		Document Content
Date: 2011-12-02 14:30:54 Topology Pseudotriangle Binary space partitioning Convex hull Collision detection Steiner tree problem Orientability Leonidas J. Guibas Delaunay triangulation Geometry Triangulation Mathematics		Lower Bounds For Kinetic Planar Subdivisions Pankaj K. Agarwaly Julien Baschz Mark de Bergx John Hershbergerk Add to Reading List Source URL: www.cs.duke.edu Download Document from Source Website File Size: 210,14 KB Share Document on Facebook

	Research Article Climbing the Steiner Tree—Sources of Active Information in a Genetic Algorithm for Solving the Euclidean Steiner Tree Problem Winston Ewert,1* William Dembski,2 Robert J. Marks II1 DocID: 1tff1 - View Document
	comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ DocID: 1rc9S - View Document
	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar DocID: 1r7hn - View Document
	LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction DocID: 1qRse - View Document
	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta† DocID: 1qObK - View Document