<--- Back to Details
First PageDocument Content
Computational complexity theory / Mathematics / Applied mathematics / Packing problems / Operations research / Algorithm / Mathematical logic / Theoretical computer science / Online algorithm / Bin packing problem / Sorting algorithm / Knapsack problem
Date: 2014-09-29 11:39:15
Computational 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

Download Document from Source Website

File Size: 113,61 KB

Share Document on Facebook

Similar Documents

A COMPARISON OF OPTIMIZATION METHODS FOR MULTI-OBJECTIVE CONSTRAINED BIN PACKING PROBLEMS  Philippe Olivier

A COMPARISON OF OPTIMIZATION METHODS FOR MULTI-OBJECTIVE CONSTRAINED BIN PACKING PROBLEMS Philippe Olivier

DocID: 1uIDg - View Document

A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin  DIAMANT Symposium – November 2012

A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012

DocID: 1rs14 - View Document

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

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

DocID: 1rlHb - View Document

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

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

DocID: 1rdLy - View Document

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

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

DocID: 1rdoS - View Document