The following pages link to Alexander Z. Zelikovsky (Q1607060):
Displaying 46 items.
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- Faster approximation algorithms for the rectilinear Steiner tree problem (Q1361816) (← links)
- (Q1383805) (redirect page) (← links)
- New approximation algorithms for the Steiner tree problems (Q1383806) (← links)
- A new approximation algorithm for finding heavy planar subgraphs (Q1400892) (← links)
- (Q1566138) (redirect page) (← links)
- A note on the colorability of mixed hypergraph using \(k\) colors (Q1566139) (← links)
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
- A faster approximation algorithm for the Steiner tree problem in graphs (Q1802062) (← links)
- An 11/6-approximation algorithm for the network Steiner problem (Q2366230) (← links)
- Maximum series-parallel subgraph (Q2429333) (← links)
- Improved approximation algorithms for the quality of service multicast tree problem (Q2484000) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- An improved approximation scheme for the Group Steiner Problem (Q2709886) (← links)
- (Q2768326) (← links)
- Practical Approximation Algorithms for Zero- and Bounded-Skew Trees (Q2784505) (← links)
- Optimal Testing of Digital Microfluidic Biochips (Q2899144) (← links)
- (Q3024759) (← links)
- A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 (Q3060717) (← links)
- (Q3137223) (← links)
- 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 (Q3183443) (← links)
- Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees (Q3434683) (← links)
- Phasing of 2-SNP Genotypes Based on Non-random Mating Model (Q3545130) (← links)
- (Q3684162) (← links)
- (Q3966182) (← links)
- (Q3966183) (← links)
- (Q3983367) (← links)
- (Q4027204) (← links)
- (Q4234134) (← links)
- (Q4252041) (← links)
- (Q4383542) (← links)
- (Q4395327) (← links)
- (Q4410160) (← links)
- (Q4710903) (← links)
- (Q4778566) (← links)
- (Q4803953) (← links)
- The moving-target traveling salesman problem (Q4820908) (← links)
- (Q4945797) (← links)
- (Q4952699) (← links)
- Tighter Bounds for Graph Steiner Tree Approximation (Q5317602) (← links)
- (Q5479886) (← links)
- Computational Science – ICCS 2005 (Q5709425) (← links)
- Algorithms and Computation (Q5712114) (← links)
- Algorithms - ESA 2003 (Q5897239) (← links)
- Algorithms and Data Structures (Q5900771) (← links)
- Spanning closed trail and hamiltonian cycle in grid graphs (Q6487981) (← links)
