Filters
Some Remarks to Proofs of Steiner Ratio for Rectilinear Steiner Trees
In this paper, we deal with rectilinear Steiner trees and their approximation by a rectilinear minimum spanning tree. It is known that the approximation ratio (called Steiner ratio) equals 1.50. In literature, seve...
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)
Eppstein?s Proof of the Steiner Ratio for Rectilinear Steiner Trees is Mistaken and How to Correct it
In this paper, we deal with rectilinear Steiner trees and their approximation by a rectilinear minimum spanning tree. It is known that the approximation ratio (called Steiner ratio) equals 1.50. In literature, seve...
BB - Aplikovaná statistika, operační výzkum
- 2001 •
- 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
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 typical approaches of approx...
JC - Počítačový hardware a software
- 2000 •
- 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 approximabil...
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 approximabil...
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
Solving Steiner Tree Problem Using Local Search Methods
The Steiner tree problem (STP) on a graph involves finding a minimum cost tree generalizes the minimum spanning tree problem and is more complicated since there are Steiner nodeswhich are not in the design...
JD - Využití počítačů, robotika a její aplikace
- 1999 •
- 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 in graphs and its modific...
BB - Aplikovaná statistika, operační výzkum
- 2000 •
- D
Rok uplatnění
D - Stať ve sborníku
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
Steiner Tree problem on various classes of directed sparse graphs. While the parameterized complexity of Steiner Tree parameterized by the number of terminals is well parameter tractable (FPT). The undirected ...
IN - Informatika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
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 approximations or heurist...
BB - Aplikovaná statistika, operační výzkum
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 16 630