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
2-approximation
20%
Approximation Algorithms
40%
Disjoint
20%
Finite Sets
20%
International Symposium
20%
Minimum Cost
20%
Minimum number
100%
Minimum Size
20%
Mobile Ad Hoc Network (MANET)
20%
Natural Transformation
20%
Node Connectivity
20%
Normed Space
20%
Problem Instances
40%
Steiner Point
100%
Survivable Network Design Problem
60%
Survivable Networks
100%
Uniform Requirements
20%
Unit Disk Graph
20%
Computer Science
Approximation Algorithms
66%
Connectivity Node
33%
Network Design Problem
100%
Problem Instance
66%
Subgraphs
33%
Uniform Requirement
33%
Mathematics
Additional Point
20%
Edge
20%
Finite Set
20%
Natural Transformation
20%
Normed Space
20%
Open Problem
20%
Set Size
20%
Steiner Point
100%
Unit Disk
20%