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 conference
›
Paper
›
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
Computer Science
Connectivity Node
100%
Approximation (Algorithm)
75%
Approximation Algorithms
50%
Polynomial Algorithm
25%
Approximation Ratio
25%
Nonnegative Integer
25%
Keyphrases
Connectivity Augmentation Problem
100%
Node Connectivity
33%
Element Connectivity
33%
Approximation Algorithms
16%
2-approximation
16%
Approximation Ratio
8%
Minimum Size
8%
Polynomial-time Algorithm
8%
NP-hard
8%
Edge-connectivity Augmentation
8%
Set Function
8%
Number of Edges
8%
Supermodular
8%
Non-negative Integer
8%
New Lower Bound
8%
Mathematics
Edge
100%
Main Result
25%
Polynomial
25%
Edge-Connectivity
25%
Set Function
25%
Nonnegative Integer
25%
Set Size
25%
Add Node
25%