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 k-node connected subgraphs via critical graphs
Guy Kortsarz,
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximating k-node connected subgraphs via critical graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Ratio
100%
Connected Subgraphs
100%
Critical Graph
100%
Undirected Graph
75%
Approximation Guarantee
75%
Directed Graph
50%
Approximation Algorithms
25%
Integrality Gap
25%
LP Relaxation
25%
Node number
25%
Minimum Cost
25%
Connected Spanning Subgraph
25%
Primal-dual Algorithm
25%
Large Values
25%
Graph Theory
25%
New Approximation
25%
Computer Science
Directed Graphs
100%
Connected Subgraph
100%
Critical Graph
100%
Approximation Ratio
80%
Approximation (Algorithm)
60%
Approximation Algorithms
20%
Subgraphs
20%
Primal-Dual
20%
Graph Theory
20%
Mathematics
Critical Graph
100%
Upper Bound
50%