We extend the (1 — 1/e)-approximation algorithm to a constant-factor approximation algorithms for a nonseparable assignment problem with applications in maximizing revenue for budget-constrained ...

Such algorithms find approximate (slightly suboptimal) solutions to optimization problems in polynomial time. Unlike heuristics, approximation algorithms have provable performance guarantees: they ...

We develop approximation algorithms for different purposes: quick response algorithms for individual customer requirement planning to build a quotation, and elaborate algorithms to provide a ...

Such algorithms find approximate (slightly suboptimal) solutions to optimization problems in polynomial time. Unlike heuristics, approximation algorithms have provable performance guarantees: they ...

In doing so, he devised perhaps the most famous approximation algorithm in theoretical computer science—one that usually forms the first example in textbooks and courses.

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

Introduction to NP-Completeness, followed by Approximation Algorithms, Randomised Algorithms, and other topics such as some of Average-Case Analysis, Streaming Algorithms, Exponential-Time Algorithms, ...