Problemy Upravleniya
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Upr.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Upravleniya, 2008, Issue 3, Pages 78–84 (Mi pu162)  
Information technologies controls

A method for solving least coverage problems as a grid planning tool

V. S. Ponomarenkoa, S. V. Listovoib

a Kharkiv National University of Economics
b Ukrainian State Academy of Railway Transport
Full-text PDF (303 kB)
References:
PDF
HTML
Abstract: A method for solving least cover and least vertex cover problems in arbitrary graphs enabling the construction of effective algorithms for calculating minimum cluster numbers is proposed. This enables the solution of a given subset of tasks in GRID with desirable efficiency.
Document Type: Article
UDC: 621.396
Language: Russian
Citation: V. S. Ponomarenko, S. V. Listovoi, “A method for solving least coverage problems as a grid planning tool”, Probl. Upr., 2008, no. 3, 78–84
Citation in format AMSBIB
\Bibitem{PonLis08}
\by V.~S.~Ponomarenko, S.~V.~Listovoi
\paper A~method for solving least coverage problems as a~grid planning tool
\jour Probl. Upr.
\yr 2008
\issue 3
\pages 78--84
\mathnet{http://mi.mathnet.ru/pu162}
Linking options:
  • https://www.mathnet.ru/eng/pu162
  • https://www.mathnet.ru/eng/pu/v3/p78
    • 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