About this document

Approximation Algorithms in Multicriteria Optimization by bb_sportsman is a document available to read on EtoBox.

This document discusses approximation algorithms for combinatorial multi-criteria optimization problems. It presents NP-completeness and #P-completeness results, showing the computational complexity of these problems. The paper outlines limits on the performance of approximation algorithms based on two definitions of approximability. It also investigates the performance of tree and Christofides

Author

bb_sportsman

Language

EN