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.

Thumbnail Image

Date

2015

Authors

Zehmakan, Abdolahad Noori
Eslahi, Mojtaba

Journal Title

Journal ISSN

Volume Title

Publisher

Access Statement

Research Projects

Organizational Units

Journal Issue

Abstract

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 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.

Description

Keywords

Citation

URI

https://hdl.handle.net/1885/733815986

Collections

ANU Research Publications

Source

Type

Working/Technical Paper

Book Title

Entity type

Publication

Access Statement

License Rights

DOI

Restricted until

DSpace software copyright © 2002-2026 LYRASIS