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 k-Connected m-Dominating Sets
Zeev Nutov
Computer Science discipline
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximating k-Connected m-Dominating Sets'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Ratio
25%
Best Ratio
25%
Connection Problem
25%
Dominating Set
100%
General Graphs
25%
K-connected
100%
Minimum Weight
25%
Node-weighted Graph
25%
Uniform Weights
25%
Unit Disk Graph
25%
Unit Weight
25%
Mathematics
Dominating Set
100%
Inf
25%
Uniform Weight
25%
Unit Disk
25%
Unit Weight
25%
weighted graph
25%