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 minimum-power edge-covers and 2, 3-connectivity
Guy Kortsarz,
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximating minimum-power edge-covers and 2, 3-connectivity'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Approximation Algorithms
100%
Connectivity Problem
100%
Power Optimization
100%
Subgraphs
100%
Mathematical Programming
100%
Network Design Problem
50%
Approximation (Algorithm)
50%
Undirected Network
50%
Connected Subgraph
50%
wireless ad hoc network
50%
Mobile Network
50%
Wireless Network
50%
Keyphrases
Minimum Power
100%
Edge Cover
100%
3-connectivity
100%
Approximation Algorithms
33%
2-approximation
33%
Connection Problem
33%
Power Optimization
33%
Mathematical Programming
33%
Graph Problems
16%
Network Design Problem
16%
Undirected Network
16%
Wireless Networks
16%
Maximum Cost
16%
Edge-disjoint Paths
16%
Network Problems
16%
Covering Problem
16%
Connected Subgraphs
16%
Steiner System
16%
Minimization Criterion
16%
Power of a Graph
16%
Power Minimization
16%
Rmax
16%
Range Assignment
16%
Multi-connectivity
16%
Mobile Application
16%
Wireless Ad-hoc Networks (WANETs)
16%
K-edge-connected
16%
Mobile Networks
16%
Mathematics
Edge
100%
Edge Cover
100%
Mathematical Programming
50%
Edge-Connectivity
25%
Incident Edge
25%