Skip to main navigation
Skip to search
Skip to main content
Ariel University Home
Help & FAQ
English
עברית
العربية
Home
Profiles
Research units
Equipment
Research output
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
On nonlinear multi-covering problems
Reuven Cohen
,
Mira Gonen
, Asaf Levin
, Shmuel Onn
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On nonlinear multi-covering problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Covering Problem
100%
K-coverage
100%
Multi-covering
100%
Optimization Problem
50%
Number of Points
50%
Set Systems
50%
NP-hard
50%
Polynomial Time
50%
Polynomial-time Algorithm
50%
Circular Arc
50%
NP-hardness Proof
50%
Natural Parameter
50%
Coverage Study
50%
Subset of Points
50%
K-subsets
50%
Mathematics
Integer
100%
Covering Problem
100%
Polynomial Time
66%
Real Line
33%
Computer Science
Optimization Problem
100%
Polynomial Time
100%
Polynomial Time Algorithm
100%