Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2006, Volume 13, Issue 1, Pages 3–15 (Mi da20)  
This article is cited in 30 scientific papers (total in 30 papers)

Computational complexity of the graph approximation problem

A. A. Ageeva, V. P. Il'evb, A. V. Kononova, A. S. Televninb

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Omsk State University
Full-text PDF (260 kB) Citations (30)
References:
PDF
HTML
Abstract: 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.
Received: 20.09.2005
English version:
Journal of Applied and Industrial Mathematics, 2007, Volume 1, Issue 1, Pages 1–8
DOI: https://doi.org/10.1134/S1990478907010012
Bibliographic databases:
UDC: 519.8
Language: Russian
Citation: A. A. Ageev, V. P. Il'ev, A. V. Kononov, A. S. Televnin, “Computational complexity of the graph approximation problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006), 3–15; J. Appl. Industr. Math., 1:1 (2007), 1–8
Citation in format AMSBIB
\Bibitem{AgeIleKon06}
\by A.~A.~Ageev, V.~P.~Il'ev, A.~V.~Kononov, A.~S.~Televnin
\paper Computational complexity of the graph approximation problem
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2006
\vol 13
\issue 1
\pages 3--15
\mathnet{http://mi.mathnet.ru/da20}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2258900}
\zmath{https://zbmath.org/?q=an:1249.68085}
\transl
\jour J. Appl. Industr. Math.
\yr 2007
\vol 1
\issue 1
\pages 1--8
\crossref{https://doi.org/10.1134/S1990478907010012}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-67849127188}
Linking options:
  • https://www.mathnet.ru/eng/da20
  • https://www.mathnet.ru/eng/da/v13/s1/i1/p3
    • This publication is cited in the following 30 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:448
    Full-text PDF :265
    References:54
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024