1991: The Steiner Tree Problem: The Steiner Tree Problem

First Page		Document Content
Date: 2014-07-31 15:13:23 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Euclidean geometry Distance Operations research Rectilinear Steiner tree Graph theory Theoretical computer science Mathematics		1991: The Steiner Tree Problem: The Steiner Tree Problem Add to Reading List Source URL: www.comap.com Download Document from Source Website File Size: 107,71 KB Share Document on Facebook

	Introduction What is constructive geometry? IEGC (Intuitionistic Euclidean Constructive Geometry) Connections to Field Theory Field theory and the parallel postulate Independence results DocID: 1tdMr - View Document
	Herbrand’s theorem and non-Euclidean geometry Michael Beeson, Pierre Boutry, Julien Narboux To cite this version: Michael Beeson, Pierre Boutry, Julien Narboux. Herbrand’s theorem and non-Euclidean geometry. Bulletin DocID: 1t313 - View Document
	The hamburger theorem Mikio Kano and Jan Kynˇcl EPFL Problem: Given n red and n blue points in the plane in general position, draw n DocID: 1rrZJ - View Document
	Singularities of the asymptotic completion of developable M¨obius strips Kosuke Naokawa Email: Let U be an open domain in Euclidean two-space R2 and f : U −→ R3 a C ∞ map. A point p ∈ U DocID: 1rq0Q - View Document
	Simplot_FinalLogo_FullColor DocID: 1rprR - View Document