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 survivable networks with minimum number of steiner points
Lior Kamma,
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximating survivable networks with minimum number of steiner points'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Minimum number
100%
Steiner Point
100%
Survivable Networks
100%
Survivable Network Design Problem
60%
Approximation Algorithms
40%
Problem Instances
40%
International Symposium
20%
2-approximation
20%
Minimum Size
20%
Disjoint
20%
Unit Disk Graph
20%
Node Connectivity
20%
Minimum Cost
20%
Normed Space
20%
Finite Sets
20%
Mobile Ad Hoc Network (MANET)
20%
Uniform Requirements
20%
Natural Transformation
20%
Computer Science
Network Design Problem
100%
Approximation Algorithms
66%
Problem Instance
66%
Connectivity Node
33%
Subgraphs
33%
Uniform Requirement
33%
Mathematics
Steiner Point
100%
Open Problem
20%
Edge
20%
Unit Disk
20%
Normed Space
20%
Set Size
20%
Finite Set
20%
Additional Point
20%
Natural Transformation
20%