APPROXIMABILITY OF MAXIMUM SPLITTING OF K-SETS AND SOME OTHER APX-COMPLETE PROBLEMS

Authors
KANN V LAGERGREN J PANCONESI A
Citation
V. Kann et al., APPROXIMABILITY OF MAXIMUM SPLITTING OF K-SETS AND SOME OTHER APX-COMPLETE PROBLEMS, Information processing letters, 58(3), 1996, pp. 105-110
Citations number
15
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
58
Issue
3
Year of publication
1996
Pages
105 - 110
Database
ISI
SICI code
0020-0190(1996)58:3<105:AOMSOK>2.0.ZU;2-9