"The inapproximability of non-NP-hard optimization problems."

Liming Cai, David W. Juedes, Iyad A. Kanj (2002)

Details and statistics

DOI: 10.1016/S0304-3975(01)00343-7

access: open

type: Journal Article

metadata version: 2023-06-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics