Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs / Equipment
Search by expertise, name or affiliation
Multi-level steiner trees
Reyan Ahmed
, Patrizio Angelini
, Faryad Darabi Sahneh
, Alon Efrat
, David Glickenstein
, Martin Gronemann
, Niklas Heinsohn
, Stephen G. Kobourov
, Richard Spence
, Joseph Watkins
, Alexander Wolff
Research output
:
Contribution to journal
›
Article
›
peer-review
5
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Multi-level steiner trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Steiner Tree Problem
100%
Steiner Tree
100%
Approximation Ratio
75%
Composite Algorithm
50%
Design Quality
25%
Network Design
25%
Approximation Algorithms
25%
Approximation Results
25%
APX-hardness
25%
Quality of Service
25%
Multicast Tree
25%
Linear Programming
25%
Best Approximation
25%
Terminal Set
25%
Network Visualization
25%
Network Generation
25%
Grade of Service
25%
Nested Sequence
25%
Negative Edges
25%
Integer Linear Programming Formulations
25%
Minimum Total Cost
25%
Multi-tier
25%
Tree Grade
25%
Multi-level Network
25%
Computer Science
steiner tree
100%
Steiner Tree Problem
100%
Approximation Ratio
75%
Approximation (Algorithm)
50%
Approximation Algorithms
25%
Integer-Linear Programming
25%
multicast tree
25%
Linear Program
25%
Quality of Service
25%
Network Design
25%
Generation Model
25%
Nested Sequence
25%
Infrastructure Level
25%