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

Approximation algorithms for the TSP endeavour to provide efficient, near‐optimal solutions where exact methods prove computationally prohibitive.

This course covers advanced topics in approximation algorithms for NP-hard problems, including combinatorial algorithms and LP-based algorithms for set cover, k-cut, k-center, feedback vertex set, ...

A string of improved approximation algorithms have since emerged, after computer scientists began looking at the problem with fresh eyes.

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

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

Michel Gendreau, Gilbert Laporte, Alain Hertz, An Approximation Algorithm for the Traveling Salesman Problem with Backhauls, Operations Research, Vol. 45, No. 4 (Jul ...