Approximability of maximum splitting of k-sets and some other Apx-complete problems
- 13 May 1996
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 58 (3), 105-110
- https://doi.org/10.1016/0020-0190(96)00046-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- The hardness of approximation: Gap locationcomputational complexity, 1994
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974