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
Power optimization for connectivity problems
Mohammad T. Hajiaghayi
, Guy Kortsarz
, Vahab S. Mirrokni
,
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Conference article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Power optimization for connectivity problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Graph Problems
100%
Connection Problem
100%
Power Optimization
100%
Connected Spanning Subgraph
100%
Approximation Algorithms
75%
K-edge
75%
Directed Graph
50%
Covering Problem
50%
Edge Cover
50%
Edge-connected
50%
NP-hard Problem
25%
Maximum Cost
25%
Minimization Criterion
25%
Power Minimization
25%
Approximation Guarantee
25%
Inapproximability
25%
Wireless multi-hop Networks
25%
Edge Disjoint Path Problem
25%
Quasi-polynomial Time
25%
Computer Science
Connectivity Problem
100%
Power Optimization
100%
Subgraphs
100%
Approximation Algorithms
60%
Directed Graphs
40%
Polynomial Time
20%
Approximation (Algorithm)
20%
Fundamental Problem
20%
multihop wireless network
20%
Mathematics
Edge
100%
Edge Cover
40%
Integer
20%
NP-hard Problem
20%
Polynomial Time
20%
Path Problem
20%