Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Pure Tutorial for OUI staff
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
The minimum degree Group Steiner problem
Guy Kortsarz,
Zeev Nutov
Computer Science discipline
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The minimum degree Group Steiner problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Steiner Problem
100%
Minimum Degree
100%
Kd-tree
100%
Undirected Graph
50%
Maximum Degree
50%
General Graphs
25%
Bicriteria Approximation
25%
Approximation Ratio
25%
Minimum Cost
25%
Bounded Treewidth Graphs
25%
Quasi-polynomial Time
25%
Degree Bounds
25%
Bi-criteria
25%
VLSI Design
25%
Folklore
25%
One-terminal
25%
Maximal Degree
25%
Online Algorithms
25%
Mathematics
Tree Problem
100%
Bicriteria
50%
Maximum Degree
50%
Main Result
25%
Approximates
25%
Polynomial Time
25%
Case Analysis
25%