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, 2011, Volume 18, Issue 1, Pages 41–60 (Mi da637)  
This article is cited in 7 scientific papers (total in 7 papers)

Approximation algorithms for graph approximation problems

V. P. Il'eva, S. D. Il'evab, A. A. Navrotskayaa

a Omsk State University, Omsk, Russia
b Omsktelecom, Omsk, Russia
Full-text PDF (328 kB) Citations (7)
References:
PDF
HTML
Abstract: Some versions of the graph approximation problem are studied. Approximation algorithms for these problems are proposed and performance guarantees of the algorithms are obtained. In particular, it is shown that the problem of approximation by graphs with a bounded number of connected components belongs to the class APX. Ill. 1, bibliogr. 12.
Keywords: graph approximation problem, approximation algorithm, performance guarantee.
Received: 20.07.2010
Revised: 29.11.2010
English version:
Journal of Applied and Industrial Mathematics, 2011, Volume 5, Issue 4, Pages 569–581
DOI: https://doi.org/10.1134/S1990478911040120
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya, “Approximation algorithms for graph approximation problems”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 41–60; J. Appl. Industr. Math., 5:4 (2011), 569–581
Citation in format AMSBIB
\Bibitem{IleIleNav11}
\by V.~P.~Il'ev, S.~D.~Il'eva, A.~A.~Navrotskaya
\paper Approximation algorithms for graph approximation problems
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 1
\pages 41--60
\mathnet{http://mi.mathnet.ru/da637}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2847828}
\zmath{https://zbmath.org/?q=an:1249.05366}
\transl
\jour J. Appl. Industr. Math.
\yr 2011
\vol 5
\issue 4
\pages 569--581
\crossref{https://doi.org/10.1134/S1990478911040120}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-82655189272}
Linking options:
  • https://www.mathnet.ru/eng/da637
  • https://www.mathnet.ru/eng/da/v18/i1/p41
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024