<--- Back to Details
First PageDocument Content
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
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

Similar Documents

NP-complete problems / Spanning tree / Steiner tree problem / Minimum spanning tree / Time complexity / Approximation algorithm / Rectilinear Steiner tree / Theoretical computer science / Graph theory / Computational complexity theory

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract

DocID: 18Vc1 - View Document

NP-complete problems / Spanning tree / Steiner tree problem / Minimum spanning tree / Time complexity / Approximation algorithm / Rectilinear Steiner tree / Theoretical computer science / Graph theory / Computational complexity theory

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract

DocID: 18HN9 - View Document

Polytopes / Euclidean plane geometry / Polyhedra / Rectilinear polygon / Vertex / Polyhedron / Simple polygon / Steiner tree problem / Dual polyhedron / Geometry / Graph theory / Polygons

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Open Problems from CCCG 2007 Erik D. Demaine∗ The following is a list of the problems presented on

DocID: 18Gqe - View Document

Polytopes / Euclidean plane geometry / Polyhedra / Rectilinear polygon / Vertex / Polyhedron / Simple polygon / Steiner tree problem / Dual polyhedron / Geometry / Graph theory / Polygons

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Open Problems from CCCG 2007 Erik D. Demaine∗ The following is a list of the problems presented on

DocID: 18Cd4 - View Document

NP-complete problems / Spanning tree / Steiner tree problem / NP-hard problems / Minimum spanning tree / Tree / Vertex cover / Rectilinear Steiner tree / Connectivity / Graph theory / Theoretical computer science / Mathematics

CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi†

DocID: 18zyF - View Document