On the complexity of approximating the independent set problem
Authors:
- Piotr BermanPBPiotr Berman
- Georg SchnitgerGSGeorg Schnitger
- 1 January 1992
- journal article
- Published by Elsevier in Information and Computation
- Vol. 96 (1) , 77-94
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Non deterministic polynomial optimization problems and their approximationsTheoretical Computer Science, 1981
- Toward a unified approach for the classification of NP-complete optimization problemsTheoretical Computer Science, 1980
- Structure preserving reductions among convex optimization problemsJournal of Computer and System Sciences, 1980
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952