DC FieldValueLanguage
dc.contributor.authorKratica, Jozefen_US
dc.contributor.authorSavić, Aleksandaren_US
dc.contributor.authorMaksimović, Zoranen_US
dc.date.accessioned2023-11-23T12:03:30Z-
dc.date.available2023-11-23T12:03:30Z-
dc.date.issued2023-
dc.identifier.issn1582-3067-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/5212-
dc.description.abstractThe recently introduced {k}-packing function problem is considered in this paper. Relationship between cases when k = 1, k ≥ 2 and linear programming relaxation are introduced with sufficient conditions for optimality. For arbitrary simple connected graph G, we propose a construction procedure for finding values of k for which L{k}(G) can be determined in the polynomial time. Additionally, relationship between {1}-packing function and independent set number is established. Optimal values for some special classes of graphs and general upper and lower bounds are introduced, as well.en_US
dc.publisherPublishing House of the Romanian Academyen_US
dc.relationMathematical Modelas and Optimization Methods on Large-Scale Systemsen_US
dc.relationGraph theory and mathematical programming with applications in chemistry and computer scienceen_US
dc.relation.ispartofMathematical Reportsen_US
dc.subjectdominating set | independent set | integer linear programming | {k}-packing function problemen_US
dc.titleSOME PROPERTIES OF {k}-PACKING FUNCTION PROBLEM IN GRAPHSen_US
dc.typeArticleen_US
dc.identifier.doi10.59277/mrar.2023.25.75.2.263-
dc.identifier.scopus2-s2.0-85169508652-
dc.contributor.affiliationMathematicsen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.grantno174010en_US
dc.relation.grantno174033en_US
dc.relation.firstpage263-
dc.relation.lastpage277-
dc.relation.issue2-
dc.relation.volume25(75)-
dc.description.rank~M23-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Engineering-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
crisitem.author.orcid0000-0002-9752-0971-
Show simple item record

Page view(s)

19
checked on Nov 23, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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