Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

A linear approximation algorithm for the BPP with the best possible absolute approximation ratio.

Simple item page
dc.contributor.authorZehmakan, Abdolahad Noorien
dc.contributor.authorEslahi, Mojtabaen
dc.date.accessioned2026-10-01T08:50:24Z
dc.date.available2026-10-01T08:50:24Z
dc.date.issued2015en
dc.description.abstractThe 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 have been presented for this problem because of its NP-hard nature. In this article also a new creative approximation algorithm is presented for this important problem. It has been proven that the best approximation ratio and the best time order for the Bin Packing Problem are 3/2 and O(n), respectively unless P=NP. The presented algorithm in this article has the best possible factors, O(n) and 3/2.en
dc.identifier.otherdblp:journals/corr/ZehmakanE15en
dc.identifier.otherORCID:/0000-0002-8569-6347/work/228394640en
dc.identifier.urihttps://hdl.handle.net/1885/733815986
dc.language.isoenen
dc.rightsDBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.en
dc.titleA linear approximation algorithm for the BPP with the best possible absolute approximation ratio.en
dc.typeWorking/Technical Paperen
dspace.entity.typePublicationen
local.contributor.affiliationZehmakan, Abdolahad Noori; ETH Zurich, Swiss Federal Institute of Technology Zurichen
local.contributor.affiliationEslahi, Mojtaba; Allameh Tabatabai Universityen
local.identifier.pure706c23fd-f88e-400d-9754-1228d877f50den
local.type.statusPublisheden

Downloads

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS