2 citations · 4 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015★ 2 cited
A linear approximation algorithm for the BPP with the best possible absolute approximation ratio
Abdolahad Noori Zehmakan, Mojtaba Eslahi
The Bin Packing Problem is one of the most important Combinatorial Optimization problems in optimization and has a lot of real-world applications. Many approximation algorithms hav…
cs.DS2015
Bin Packing Problem: Two Approximation Algorithms
Abdolahad Noori Zehmakan
The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its NP-hard nature, several approximation algorithms have been presented. It is…