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]

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of applied and industrial mathematics Ročník 1; číslo 1; s. 1 - 8
Hlavní autoři: Ageev, A. A., Il’ev, V. P., Kononov, A. V., Talevnin, A. S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Springer Nature B.V 01.03.2007
Témata:
Algorithms
Approximation
Complexity
Computation
Graph theory
Graphs
Mathematical analysis
Mathematical models
ISSN:1990-4789, 1990-4797
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1990-4789
1990-4797
DOI:10.1134/S1990478907010012