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 discipline
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 (Algorithm)
50%
Approximation Algorithms
100%
Connected Subgraph
50%
Connectivity Problem
100%
Mathematical Programming
100%
Mobile Network
50%
Network Design Problem
50%
Power Optimization
100%
Subgraphs
100%
Undirected Network
50%
wireless ad hoc network
50%
Wireless Networks
50%
Keyphrases
2-approximation
33%
3-connectivity
100%
Approximation Algorithms
33%
Connected Subgraphs
16%
Connection Problem
33%
Covering Problem
16%
Edge Cover
100%
Edge-disjoint Paths
16%
Graph Problems
16%
K-edge-connected
16%
Mathematical Programming
33%
Maximum Cost
16%
Minimization Criterion
16%
Minimum Power
100%
Mobile Application
16%
Mobile Networks
16%
Multi-connectivity
16%
Network Design Problem
16%
Network Problems
16%
Power Minimization
16%
Power of a Graph
16%
Power Optimization
33%
Range Assignment
16%
Rmax
16%
Steiner System
16%
Undirected Network
16%
Wireless Ad-hoc Networks (WANETs)
16%
Wireless Networks
16%
Mathematics
Edge
100%
Edge Cover
100%
Edge-Connectivity
25%
Incident Edge
25%
Mathematical Programming
50%