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
LP-relaxations for tree augmentation
Guy Kortsarz,
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'LP-relaxations for tree augmentation'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
2-approximation
25%
2-edge-connected
25%
Approximation Algorithms
25%
Approximation Ratio
25%
Best Approximation
25%
Combinatorial Algorithms
25%
Edge Set
50%
Feasible Solution
25%
Integrality Gap
25%
LP Relaxation
100%
Minimum Size
25%
Minimum Weight
25%
Network Design Problem
25%
Tree Augmentation
100%
Computer Science
Approximation Algorithms
100%
Approximation Ratio
100%
Feasible Solution
100%
Network Design Problem
100%
Mathematics
Best Approximation
33%
Combinatorial Algorithm
33%
Edge
100%
Feasible Solution
33%
Open Problem
66%