Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Link opens in a new tab
Search content at Ben-Gurion University Research Portal
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs
Bottleneck bichromatic full steiner trees
A. Karim Abu-Affash
, Sujoy Bhore
,
Paz Carmi
, Dibyayan Chakraborty
Research output
:
Contribution to conference
›
Paper
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bottleneck bichromatic full steiner trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bichromatic
100%
Full Steiner Tree
100%
Steiner Tree Problem
40%
Steiner Point
20%
Longest Edge
20%
Steiner Tree
20%
Polynomial Time
10%
Time Algorithm
10%
Approximation Algorithms
10%
NP-hard
10%
Terminal Point
10%
Mathematics
Tree Problem
100%
Edge
75%
Steiner Point
50%
Polynomial Time
25%
Terminal Point
25%