Fundamenta Informaticae > 2004 > Vol. 62, nr 3,4 > 369--375
Source
Abstract
Identifiers
journal ISSN : | 0169-2968 |
journal e-ISSN : | 1875-8681 |
Authors
Keywords
Additional information
Publisher
Fields of science
Bibliography
-
[1] A.A. Ageev and M.I. Sviridenko. Approximation algorithms for Maximum Coverage and Max Cut with cardinality constraints. Proceedings of IPCO99, Lecture Notes in Computer Science 1610, pp. 17-30,1999.
-
[2] S. Arora, D. Karger and M. Karpinski. Polynomial Time Approximation Schemes for Dense Instances of NP-hard Problems, Proceedings 27th ACM STOC, pp. 284-293,1995.
-
[3] K. Diks, H.N. Djidjev, O. Sykora and I. Vrto. Edge Separators of Planar and Outerplanar Graphs with Applications. Journal of Algorithms 14, pp. 258-279 (1993).