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 discipline
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
Mathematics
Augmentation
100%
Connectivity
76%
Vertex of a graph
34%
Approximation
15%
Approximation Algorithms
13%
Edge-connectivity
9%
Polynomial Algorithm
8%
Graph in graph theory
7%
Skew
6%
Requirements
6%
NP-complete problem
5%
Cover
5%
Non-negative
5%
Path
5%
Lower bound
5%
Subset
4%
Integer
4%
Engineering & Materials Science
Approximation algorithms
91%
Set theory
54%
NP-hard
40%
Polynomials
32%