Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Approve / Request updates on publications
Link opens in a new tab
English
עברית
العربية
Search content at Open University of Israel
Home
Researchers
Research units
Research outputs
Prizes
Activities
Approximating k-Connected m-Dominating Sets
Zeev Nutov
Computer Science
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
K-connected
100%
Dominating Set
100%
General Graphs
25%
Approximation Ratio
25%
Unit Disk Graph
25%
Minimum Weight
25%
Best Ratio
25%
Unit Weight
25%
Connection Problem
25%
Uniform Weights
25%
Node-weighted Graph
25%
Mathematics
Dominating Set
100%
weighted graph
25%
Unit Disk
25%
Inf
25%
Uniform Weight
25%
Unit Weight
25%