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
Approximating steiner networks with node-weights
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximating steiner networks with node-weights'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Algorithms
50%
Approximation Ratio
25%
Disjoint
12%
Edge Cover
25%
Edge Nodes
12%
Edge Weight
12%
Edge-connectivity
25%
Family of Sets
25%
Minimum Weight
25%
Network Problems
37%
Node Connectivity
12%
Node Weight
100%
Rmax
62%
Set Function
12%
Steiner System
100%
Unit Weight
12%
Weighted Edge
12%
Mathematics
Edge
100%
Edge Cover
66%
Edge-Connectivity
66%
Seminal Paper
33%
Set Function
33%
Unit Weight
33%
Computer Science
Approximation Algorithms
100%
Approximation Ratio
50%
Connectivity Node
25%
Subgraphs
25%