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 connectivity augmentation problems
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximating connectivity augmentation problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Connectivity Augmentation
100%
Connectivity Augmentation Problem
100%
Node Connectivity
50%
Element Connectivity
50%
Approximation Algorithms
20%
2-approximation
20%
V(V)
20%
Edge-connectivity Augmentation
20%
Undirected Graph
10%
Approximation Ratio
10%
Minimum Size
10%
Polynomial-time Algorithm
10%
NP-hard
10%
Splitting off
10%
Rmax
10%
Set Function
10%
Number of Edges
10%
Supermodular
10%
Non-negative Integer
10%
Mathematics
Edge
100%
Edge-Connectivity
66%
Main Result
33%
Polynomial Time
33%
Set Function
33%
Nonnegative Integer
33%
Set Size
33%
Computer Science
Connectivity Node
100%
Approximation Algorithms
40%
Approximation (Algorithm)
40%
Approximation Ratio
20%
Directed Graphs
20%
Nonnegative Integer
20%
polynomial-time algorithm
20%