Back to Results
First PageMeta Content
Operations research / NP-complete problems / Combinatorial optimization / Mathematical optimization / Job shop scheduling / Bin packing problem / Approximation algorithm / Optimization problem / Knapsack problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2007-09-03 21:58:04


Open Document

File Size: 1,68 MB

Share Result on Facebook

City

Cambridge / /

Currency

ECS / USD / /

Facility

Practical Results DORIT S. HOCHBAUM University of California / Massachusetts Institute of Technology / Calijornia AND DAVID B. SHMOYS Mussuchasetts Institute of Technology / University of California / /

IndustryTerm

e-approximation algorithm / list processing algorithms / approximation algorithm / dual approximation algorithms / binary search procedure / primal and dual approximation algorithms / e-makespan / +approximation algorithm / c-approximation algorithm / dynamic programming algorithm / e-dual approximation algorithm / above algorithm / c-dual approximation algorithm / f-approximation algorithm / bin-packing algorithm / l/j-dual approximation algorithm / list processing schedule / approximation algorithms / bin-packing algorithms / t-approximation algorithm / Polynomial-time algorithms / t-approximation algorithms / dual approximation algorithm / given processing times / binary search / primal approximation algorithm / binary search approach / designated integral processing times pj / t-dual approximation algorithm / polynomialtime algorithm / feasible solutions / infeasible solution / /

Organization

National Science Foundation / University of California / Berkeley / Department of Mathematics / Association for Computing Machinery / Institute of Technology / /

Person

DAVID B. SHMOYS / /

Position

manager / General / /

ProvinceOrState

California / Massachusetts / /

Technology

corresponding algorithm / above algorithm / following algorithm / c-approximation algorithm / t/Zdual approximation algorithm / t-approximation algorithm / f-approximation algorithm / l/j-dual approximation algorithm / Polynomial-time algorithms / primal approximation algorithm / bin-packing algorithms / t-dual approximation algorithm / assumed algorithm / polynomialtime algorithm / 1/j-dual approximation algorithm / l/5 Dual Approximation Algorithm / e-dual approximation algorithm / often called t-approximation algorithms / 146 D. S. HOCHBAUM AND D. B. SHMOYS MULTIFIT algorithm / constructing approximation algorithms / list processing algorithms / dual approximation algorithm / 162 Dual Approximation Algorithms / primal and dual approximation algorithms / MULTIFIT algorithm / Phrases /

SocialTag