Searching for authors named "Alexander Zelikovsky" – sorted by Relevance.
33 documents found, showing 1 through 10.
Next 10 →
-
Better approximation bounds for the network and Euclidean Steiner tree problems
- …The network and Euclidean Steiner tree problems require a shortest tree spanning a given vertex subset within a network G = (V; E; d) and Euclidean plane, respectively. For these problems, we present a series of heuristics finding approximate Steiner tree with performance guarantee coming arbitrary …
- Cited by 37 (3 self) – Add To MetaCart
-
A series of approximation algorithms for the Acyclic Directed Steiner Tree problem
- …Abstract Given an acyclic directed network, a subset S of nodes (terminals), and a root r, the acyclic directed Steiner tree problem requires a minimum-cost subnetwork which contains paths from r to each terminal. It is known that unless NP ` DT IME[npolylogn] no polynomial-time algorithm can guaran…
- Cited by 21 (1 self) – Add To MetaCart
-
On Approximation of the Power-p and Bottleneck Steiner Trees
- …Many VLSI routing applications, as well as the facility location problem involve computation of Steiner trees with non-linear cost measures. We consider two most frequent versions of this problem. In the power-p Steiner problem the the cost is defined as the sum of the edge length raised to power p,…
- Add To MetaCart
-
Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs
- …. In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube and polymino. A Spanning closed trail is an eulerian subgraph containing all vertices of a given graph. For general grid graphs we prove that the problem of finding that trail is NP-complete and for…
- Cited by 3 (0 self) – Add To MetaCart
-
Tighter Bounds for Graph Steiner Tree Approximation
- …Abstract. The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomial-ln 3 time heuristic that achieves a best-known approximation ratio of 1 + ≈ 1.55 for general graphs 2 and best-…
- Cited by 20 (2 self) – Add To MetaCart
-
Approximating Dense Cases of Covering Problems
- …We study dense cases of several covering problems. An instance of the set cover problem with m sets is dense if there is ffl ? 0 such that any element belongs to at least fflm sets. We show that the dense set cover problem can be approximated with the performance ratio c log n for any c ? 0 and it …
- Cited by 10 (0 self) – Add To MetaCart
-
New Approximation Algorithms for the Steiner Tree Problems
- …The Steiner tree problem asks for the shortest tree connecting a given set of terminal points in a metric space. We design new approximation algorithms for the Steiner tree problems using a novel technique of choosing Steiner points in dependence on the possible deviation from the optimal solutions.…
- Cited by 23 (4 self) – Add To MetaCart
-
1.757 and 1.267-Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
- …The Steiner tree problem requires to find a shortest tree connecting a given set of terminal points in a metric space. We suggest a better and fast heuristic for the Steiner problem in graphs and in rectilinear plane. This heuristic finds a Steiner tree at most 1.757 and 1.267 times longer than the …
- Cited by 2 (1 self) – Add To MetaCart
-
Improved Steiner Tree Approximation in Graphs
- …The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomial-time heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously best-known approximation…
- Cited by 140 (6 self) – Add To MetaCart
-
DISCRETE ALGORITHMS FOR ANALYSIS OF GENOTYPE DATA
- …Accessibility of high-throughput genotyping technology makes possible genome-wide association studies for common complex diseases. When dealing with common diseases, it is necessary to search and analyze multiple independent causes resulted from interactions of multiple genes scattered over the enti…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
