DC FieldValueLanguage
dc.contributor.authorGainanov, Damiren
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorRasskazova, Varvaraen
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:52Z-
dc.date.available2020-05-01T20:13:52Z-
dc.date.issued2018-01-01en
dc.identifier.issn1613-0073en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1764-
dc.description.abstractThe paper presents an algorithm for finding the maximum independent set in an undirected graph with absolute estimate of the accuracy. Special notions are indroduced and theoretical results in the area of deviation of approximate solution from the exact one are pre-sended. Also the paper presents results of computational experiments on the complementary graphs DIMACS.en
dc.publisherCEUR-WS-
dc.relation.ispartofCEUR Workshop Proceedingsen
dc.subjectAbsolute estimate of the accuracy | Algorithm | Maximum independent seten
dc.titleHeuristic algorithm for finding the maximum independent set with absolute estimate of the accuracyen
dc.typeConference Paperen
dc.relation.conference2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018; Omsk; Russian Federation; 8 July 2018 through 14 July 2018-
dc.identifier.scopus2-s2.0-85047982690en
dc.relation.firstpage141en
dc.relation.lastpage149en
dc.relation.volume2098en
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeConference Paper-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

6
checked on Nov 23, 2024

Page view(s)

19
checked on Nov 23, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.