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
Inapproximability of survivable networks
Yuval Lando,
Zeev Nutov
Computer Science discipline
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Inapproximability of survivable networks'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Inapproximability
100%
Survivable Network Design Problem
100%
Survivable Networks
100%
Hardness of Approximation
40%
Network Design Problem
20%
Approximation Ratio
20%
Node Connectivity
20%
Vertex Connectivity
20%
K-connected Graph
20%
Minimum Cost
20%
Network Connectivity
20%
Directed Steiner Tree
20%
Approximation Results
20%
Computer Science
Network Design Problem
100%
Approximation (Algorithm)
83%
Approximation Ratio
16%
Vertex Connectivity
16%
Connectivity Node
16%
Connected Subgraph
16%
Subgraphs
16%
steiner tree
16%
Mathematics
Main Result
100%
Network Connectivity
100%