Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Steiner_tree_problem> ?p ?o. }
Showing items 1 to 62 of
62
with 100 items per page.
- Steiner_tree_problem abstract "The Steiner tree problem, or the minimum Steiner tree problem, named after Jakob Steiner, is a problem in combinatorial optimization, which may be formulated in a number of settings, with the common part being that it is required to find the shortest interconnect for a given set of objects.The Steiner tree problem is superficially similar to the minimum spanning tree problem: given a set V of points (vertices), interconnect them by a network (graph) of shortest length, where the length is the sum of the lengths of all edges. The difference between the Steiner tree problem and the minimum spanning tree problem is that, in the Steiner tree problem, extra intermediate vertices and edges may be added to the graph in order to reduce the length of the spanning tree. These new vertices introduced to decrease the total length of connection are known as Steiner points or Steiner vertices. It has been proved that the resulting connection is a tree, known as the Steiner tree. There may be several Steiner trees for a given set of initial vertices.The Steiner tree problem has applications in circuit layout or network design. Most versions of the Steiner tree problem are NP-complete. In fact, one of these was among Karp's original 21 NP-complete problems. Some restricted cases can be solved in polynomial time. In practice, heuristics are used.".
- Steiner_tree_problem thumbnail Steiner_3_points.svg?width=300.
- Steiner_tree_problem wikiPageExternalLink aptsver.html.
- Steiner_tree_problem wikiPageExternalLink phylomurka.sf.net.
- Steiner_tree_problem wikiPageExternalLink steinerkompendium.
- Steiner_tree_problem wikiPageExternalLink RonaldLG1988.
- Steiner_tree_problem wikiPageExternalLink implement.shtml.
- Steiner_tree_problem wikiPageID "498304".
- Steiner_tree_problem wikiPageRevisionID "601699393".
- Steiner_tree_problem first "M.".
- Steiner_tree_problem hasPhotoCollection Steiner_tree_problem.
- Steiner_tree_problem id "s/s110270".
- Steiner_tree_problem last "Hazewinkel".
- Steiner_tree_problem title "Steiner tree problem".
- Steiner_tree_problem subject Category:Computational_problems_in_graph_theory.
- Steiner_tree_problem subject Category:Geometric_algorithms.
- Steiner_tree_problem subject Category:Geometric_graphs.
- Steiner_tree_problem subject Category:NP-complete_problems.
- Steiner_tree_problem subject Category:Trees_(graph_theory).
- Steiner_tree_problem type Abstraction100002137.
- Steiner_tree_problem type Act100030358.
- Steiner_tree_problem type Activity100407535.
- Steiner_tree_problem type Algorithm105847438.
- Steiner_tree_problem type Attribute100024264.
- Steiner_tree_problem type Communication100033020.
- Steiner_tree_problem type ComputationalProblemsInGraphTheory.
- Steiner_tree_problem type Condition113920835.
- Steiner_tree_problem type Difficulty114408086.
- Steiner_tree_problem type Event100029378.
- Steiner_tree_problem type GeometricAlgorithms.
- Steiner_tree_problem type GeometricGraphs.
- Steiner_tree_problem type Graph107000195.
- Steiner_tree_problem type NP-completeProblems.
- Steiner_tree_problem type Problem114410605.
- Steiner_tree_problem type Procedure101023820.
- Steiner_tree_problem type PsychologicalFeature100023100.
- Steiner_tree_problem type Rule105846932.
- Steiner_tree_problem type State100024720.
- Steiner_tree_problem type VisualCommunication106873252.
- Steiner_tree_problem type YagoPermanentlyLocatedEntity.
- Steiner_tree_problem comment "The Steiner tree problem, or the minimum Steiner tree problem, named after Jakob Steiner, is a problem in combinatorial optimization, which may be formulated in a number of settings, with the common part being that it is required to find the shortest interconnect for a given set of objects.The Steiner tree problem is superficially similar to the minimum spanning tree problem: given a set V of points (vertices), interconnect them by a network (graph) of shortest length, where the length is the sum of the lengths of all edges. ".
- Steiner_tree_problem label "Arbre de Steiner".
- Steiner_tree_problem label "Drzewo Steinera".
- Steiner_tree_problem label "Steiner tree problem".
- Steiner_tree_problem label "Steinerbaumproblem".
- Steiner_tree_problem label "Steinerboomprobleem".
- Steiner_tree_problem label "Árbol de Steiner".
- Steiner_tree_problem label "Задача Штейнера".
- Steiner_tree_problem label "シュタイナー木".
- Steiner_tree_problem sameAs Steinerbaumproblem.
- Steiner_tree_problem sameAs Árbol_de_Steiner.
- Steiner_tree_problem sameAs Arbre_de_Steiner.
- Steiner_tree_problem sameAs シュタイナー木.
- Steiner_tree_problem sameAs Steinerboomprobleem.
- Steiner_tree_problem sameAs Drzewo_Steinera.
- Steiner_tree_problem sameAs m.02hnn7.
- Steiner_tree_problem sameAs Q1764144.
- Steiner_tree_problem sameAs Q1764144.
- Steiner_tree_problem sameAs Steiner_tree_problem.
- Steiner_tree_problem wasDerivedFrom Steiner_tree_problem?oldid=601699393.
- Steiner_tree_problem depiction Steiner_3_points.svg.
- Steiner_tree_problem isPrimaryTopicOf Steiner_tree_problem.
