Filters
Approximate and Heuristic Algorithms for Solving Steiner Tree Problem
Steiner tree problem in graphs and its geometric modifications rectilinear and Euclidean Steiner tree problems belong to NP-complete problems network optimisation. This paper summarises t...
JC - Počítačový hardware a software
- 2000 •
- D
Rok uplatnění
D - Stať ve sborníku
Heuristic Approaches for Rectilinear Steiner Tree Problem
Heuristic Approaches for Rectilinear Steiner Tree Problem...
BB - Aplikovaná statistika, operační výzkum
- 2000 •
- D
Rok uplatnění
D - Stať ve sborníku
Applications of Steiner Trees in Network Optimization
Steiner tree problem in graphs represents searching of minimal tree there are simple polynomial algorithms for solving minimum spanning tree problem, Steiner tree problem
BB - Aplikovaná statistika, operační výzkum
- 2000 •
- D
Rok uplatnění
D - Stať ve sborníku
Solving Steiner Tree Problem Using Local Search Methods
The Steiner tree problem (STP) on a graph involves finding a minimum cost tree which connects a designated subset of the nodes in the graph. This problem generalizes the minimum spanning tree ...
JD - Využití počítačů, robotika a její aplikace
- 1999 •
- D
Rok uplatnění
D - Stať ve sborníku
Insertion Heuristic for the Euclidean Steiner Tree Problem
The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approxi...
BB - Aplikovaná statistika, operační výzkum
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Parameterized approximation schemes for steiner trees with small number of Steiner vertices
We study the Steiner Tree problem, in which a set of terminal vertices needs. In particular, on one hand Steiner Tree is known to be APX-hard, and W[2]-hard on the other further study the parameterized app...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES
We study the Steiner Tree problem, in which a set of terminal vertices needs. In particular, on one hand Steiner Tree is known to be APX-hard, and W[2]-hard on the other further study the parameterized app...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
An Approximation for the Steiner Tree Problem in the Euclidean Plane
The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approxi...
BB - Aplikovaná statistika, operační výzkum
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane
The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approxi...
BB - Aplikovaná statistika, operační výzkum
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Solving the Euclidean Steiner Tree Problem Using Delaunay Triangulation
The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem being NP-hard, polynomial-time approxi...
BB - Aplikovaná statistika, operační výzkum
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 109 790