Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Bin covering with cardinality constraints
Leah Epstein
, Csanád Imreh
, Asaf Levin
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bin covering with cardinality constraints'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Cardinality Constraint
100%
Asymptotic Competitive Ratio
100%
Bin Covering
100%
Tight Bounds
33%
AFPTAS
33%
Set Covering
33%
Set Covering Problem
33%
Greedy Algorithm
16%
Online Algorithms
16%
Covering Problem
16%
Packing Problem
16%
K Parameter
16%
Semi-online
16%
Nondecreasing
16%
Nonincreasing
16%
Number of Sets
16%
Set Packing
16%
Dual Problem
16%
Asymptotic Performance
16%
Mathematics
Cardinality
100%
Asymptotics
100%
Competitive Ratio
85%
Covering Problem
42%
Main Result
14%
Greedy Algorithm
14%
Packing Problem
14%
Set Packing
14%
Dual Problem
14%
Nonincreasing Order
14%
Total Sum
14%
Computer Science
Cardinality
100%
Competitive Ratio
100%
Set Covering Problem
33%
on-line algorithm
16%
Packing Problem
16%
Dual Problem
16%
Nonincreasing Order
16%
Greedy Algorithm
16%