Skip to content
RDL
Network
Ekosistem
Uygulama değiştir
EN
Hakkımızda
SSS
Giriş yap
Başla
A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm — Minyi Yue (1995) | RDL Network
Back
Cite
Save
Save for later
Share
Home
Publications
A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm
LZ
Shared by
Lei Zhang
A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm
Article
1995
en
Authors
MY
Minyi Yue
LZ
Lei Zhang
Discussion
(0)
Sign in
to like and join the discussion.
No comments yet. Be the first to comment.
Related publications
Article
2017
On the equality condition for the I-MMSE proof of the entropy power inequality
Alex Dytso
,
Ronit Bustin
,
H Vincent Vincent Poort
,
Shlomo Shamai
Preprint
2017
Comment on the Equality Condition for the I-MMSE Proof of Entropy Power Inequality
Alex Dytso
,
Ronit Bustin
,
H Vincent Vincent Poort
,
Shlomo Shamai
Article
1997
A simple algorithm for computing minimum spanning trees in the internet
H. Abdel-Wahab
,
Ion Stoica
,
Faisal Sultan
,
Khym Wilson
Article
2003
A simple algorithm for finding frequent elements in streams and bags
Richard M. Karp
,
Scott Shenker
,
Christos H. Papadimitriou
Article
2023
Aesculus hippocastanum L.: A Simple Ornamental Plant or a Source of Compelling Molecules for Industry?
Asma Dridi
,
Filipa S. Reis
,
Tânia C. S. P. Pires
,
Ricardo C. Calhelha
,
Carla Pereira
,
Khalil Zaghdoudi
,
Isabel Cristina Fernandes Rodrigues Ferreira
,
Lillian Barros
,
João C.M. Barreira
Discussion(0)
No comments yet. Be the first to comment.