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
Approximation Ratio
25%
Bi-criteria
25%
Bicriteria Approximation
25%
Bounded Treewidth Graphs
25%
Degree Bounds
25%
Folklore
25%
General Graphs
25%
Kd-tree
100%
Maximal Degree
25%
Maximum Degree
50%
Minimum Cost
25%
Minimum Degree
100%
One-terminal
25%
Online Algorithms
25%
Quasi-polynomial Time
25%
Steiner Problem
100%
Undirected Graph
50%
VLSI Design
25%
Mathematics
Approximates
25%
Bicriteria
50%
Case Analysis
25%
Main Result
25%
Maximum Degree
50%
Polynomial Time
25%
Tree Problem
100%