mccormick.northwestern.edu

COMP_SCI 437: Approximation Algorithms

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...
JSTOR Daily

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of the ...
CU Boulder News & Events

CSCA 5424: Approximation Algorithms and Linear Programming

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...
Queen Mary University of London

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries

Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...