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
On minimum power connectivity problems
Yuval Lando,
Zeev Nutov
Computer Science discipline
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On minimum power connectivity problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Algorithms
100%
Connection Problem
100%
Directed Graph
100%
Disjoint
50%
Edge-connectivity
50%
Improved Approximation
50%
Inapproximability Results
50%
Logarithmic Approximation
50%
Maximum Cost
50%
Minimization Criterion
50%
Minimum Power
100%
Network Design Problem
50%
Polynomial Approximation
50%
Polynomial-time Algorithm
50%
Power Minimization
50%
Undirected Graph
100%
Wireless Networks
50%
Computer Science
Approximation (Algorithm)
25%
Approximation Algorithms
50%
Connectivity Problem
100%
Directed Graphs
100%
Logarithmic Approximation
25%
Network Design Problem
25%
Polynomial Algorithm
25%
Subgraphs
25%
Wireless Networks
25%
Mathematics
Edge
100%
Edge-Connectivity
50%
Main Result
50%
Polynomial
100%