Bin packing problem

Results: 81



#Item
1Mathematics / Computational complexity theory / Algebra / NP-complete problems / Analysis of algorithms / Set cover problem / Bin packing problem / Linear programming relaxation / Vertex cover / Ring / Exponentiation / Big O notation

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:52
2Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Packing problems / Operations research / Approximation algorithms / Knapsack problem / Vertex cover / Bin packing problem / Hardness of approximation / Algorithm

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-06-04 08:46:15
3Computational complexity theory / Mathematics / NP-complete problems / Theory of computation / Set cover problem / Approximation algorithm / Algorithm / Analysis of algorithms / Bin packing problem / Vertex cover

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2013-03-13 08:17:47
4Mathematics / Mathematical analysis / Stochastic processes / Probability / Lemmas / Bin packing problem / Random walk / Coupling / Combinatorics

Average-Case Analyses of First Fit and Random Fit Bin Packing Susanne Albers Michael Mitzenmachery Abstract

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:05:58
5Computational complexity theory / Packing problems / Theory of computation / Bin packing problem / Bin

Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS+ Online Seminar May 22, 2013

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
6Computational complexity theory / Mathematics / Applied mathematics / Packing problems / Operations research / Algorithm / Mathematical logic / Theoretical computer science / Online algorithm / Bin packing problem / Sorting algorithm / Knapsack problem

CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-09-29 11:39:15
7Computational complexity theory / Theory of computation / Complexity classes / Strong NP-completeness / Polynomial-time approximation scheme / Bin / Packing problems / NP-complete problems / Bin packing problem

Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
8Operations research / Approximation algorithm / Computational complexity theory / WAOA-FM / Mathematical optimization / Bin packing problem / Mathematics / Applied mathematics

ALGO 2010 ATMOS/WAOA schedule THURSDAY 9 Sept:30 - 9:00 9:00 - 9:50 10::20

Add to Reading List

Source URL: algo2010.csc.liv.ac.uk

Language: English - Date: 2010-09-01 10:39:54
9Packing problems / Bin packing problem / Analysis of algorithms / Computer science / Mathematics / Online algorithms / Competitive analysis / Bin / Applied mathematics / Operations research / NP-complete problems

Dynamic Bin Packing of Unit Fractions Items Joseph Wun-Tat Chan† Tak-Wah Lam‡ ∗

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2008-04-19 01:25:32
10Packing problems / Bin packing problem

Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items Mihai Burcea⋆ , Prudence W.H. Wong, and Fencol C.C. Yung Department of Computer Science, University of Liverpool, UK {m.burcea,pwong}@liverpool.ac.uk,

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2013-01-24 10:01:00
UPDATE