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
Lower bounds on the performance of online algorithms for relaxed packing problems
János Balogh
, György Dósa
,
Leah Epstein
, Łukasz Jeż
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Lower bounds on the performance of online algorithms for relaxed packing problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Competitive Ratio
100%
Online Algorithms
100%
Packing Problem
100%
Scheduling Problem
66%
Appointment Scheduling
66%
New Lower Bound
33%
One Dimension
33%
Optimal number
33%
Knapsack Problem
33%
Knapsack
33%
Ratio Measures
33%
Multiple Knapsack
33%
Online Packing
33%
Multiple Knapsack Problem
33%
Computer Science
Competitive Ratio
100%
on-line algorithm
100%
Packing Problem
100%
Knapsack Problem
66%
Knapsack
66%
Scheduling Problem
66%
Formalization
33%
Multiple Dimension
33%
Mathematics
Competitive Ratio
100%
Packing Problem
100%
Combinatorial Optimization
66%
time interval τ
33%
Optimal Number
33%
Formalization
33%
One Dimension
33%