Computational complexity of the graph approximation problem

The computational complexity of the graph approximation problem is investigated. It is shown that the different variants of this problem are NP-hard both for undirected and directed graphs. A polynomial-time approximation scheme (PTAS) for one of the variants is presented.[PUBLICATION ABSTRACT]

Bibliographic Details

Published in:	Journal of applied and industrial mathematics Vol. 1; no. 1; pp. 1 - 8
Main Authors:	Ageev, A. A., Il’ev, V. P., Kononov, A. V., Talevnin, A. S.
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Nature B.V 01.03.2007
Subjects:	Algorithms Approximation Complexity Computation Graph theory Graphs Mathematical analysis Mathematical models
ISSN:	1990-4789, 1990-4797
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!