Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Approve / Request updates on publications
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
Tight approximation algorithm for connectivity augmentation problems
Guy Kortsarz
,
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Tight approximation algorithm for connectivity augmentation problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Algorithms
100%
Approximation Ratio
33%
Connectivity Augmentation
100%
Connectivity Augmentation Problem
100%
Directed Connectivity
33%
Directed Graph
16%
Edge-connectivity Augmentation
33%
Minimum Size
16%
Node Connectivity
33%
Polynomial-time Algorithm
16%
Rmax
50%
Set Covering Problem
16%
Tight
100%
Undirected Connectivity
33%
Undirected Graph
16%
V(V)
16%
Computer Science
Approximation (Algorithm)
66%
Approximation Algorithms
100%
Approximation Ratio
66%
Connectivity Node
66%
Directed Graphs
66%
Polynomial Algorithm
33%