<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://www.zbc.uz.zgora.pl/repozytorium/style/common/xsl/oai-style.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/
         http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
	<responseDate>2026-06-28T05:08:33Z</responseDate>
	<request identifier="oai:zbc.uz.zgora.pl:86082" metadataPrefix="oai_dc" verb="GetRecord">
	https://zbc.uz.zgora.pl/repozytorium/oai-pmh-repository.xml</request>
	<GetRecord>
	
  <record>
	<header>
		<identifier>oai:zbc.uz.zgora.pl:86082</identifier>
	    <datestamp>2025-07-15T12:56:18Z</datestamp>
		  <setSpec>DigitalLibraryZielonaGora</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:Faculties:FacultyComputerElectricalControl</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:ListJurnals:AMCS:AMCS20</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:Faculties</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:TypesWork</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:TypesWork:Articles</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:ListJurnals</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:ListJurnals:AMCS</setSpec> 	    </header>
		<metadata>
	<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="pl"><![CDATA[A genetic algorithm for the maximum 2-packing set problem]]></dc:title>
<dc:creator><![CDATA[Trejo-Sánchez, Joel Antonio]]></dc:creator>
<dc:creator><![CDATA[Fajardo-Delgado, Daniel]]></dc:creator>
<dc:creator><![CDATA[Gutierrez-Garcia, J. Octavio]]></dc:creator>
<dc:subject xml:lang="pl"><![CDATA[maximum 2-packing set]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[genetic algorithms]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[graph algorithms]]></dc:subject>
<dc:description xml:lang="pl"><![CDATA[Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality. In this paper, we present a genetic algorithm for the maximum 2-packing set problem on arbitrary graphs, which is an NP-hard problem. To the best of our knowledge, this work is a pioneering effort to tackle this problem for arbitrary graphs. For comparison, we extended and outperformed a well-known genetic algorithm originally designed for the maximum independent set problem.]]></dc:description>
<dc:description xml:lang="pl"><![CDATA[We also compared our genetic algorithm with a polynomial-time one for the maximum 2-packing set problem on cactus graphs. Empirical results show that our genetic algorithm is capable of finding 2-packing sets with a cardinality relatively close (or equal) to that of the maximum 2-packing sets. Moreover, the cardinality of the 2-packing sets found by our genetic algorithm increases linearly with the number of vertices and with a larger population and a larger number of generations. Furthermore, we provide a theoretical proof demonstrating that our genetic algorithm increases the fitness for each candidate solution when certain conditions are met.]]></dc:description>
<dc:publisher><![CDATA[Zielona Góra: Uniwersytet Zielonogórski]]></dc:publisher>
<dc:contributor><![CDATA[Korbicz, Józef (1951- ) - red.]]></dc:contributor>
<dc:contributor><![CDATA[Uciński, Dariusz - red.]]></dc:contributor>
<dc:date><![CDATA[2020]]></dc:date>
<dc:type xml:lang="pl"><![CDATA[artykuł]]></dc:type>
<dc:identifier><![CDATA[http://www.zbc.uz.zgora.pl/repozytorium/Content/86082/AMCS_2020_30_1_14.pdf]]></dc:identifier>
<dc:identifier><![CDATA[https://zbc.uz.zgora.pl/repozytorium/dlibra/publication/101094/edition/86082/content]]></dc:identifier>
<dc:identifier><![CDATA[oai:zbc.uz.zgora.pl:86082]]></dc:identifier>
<dc:source xml:lang="pl"><![CDATA[AMCS, volume 30, number 1 (2020)]]></dc:source>
<dc:source xml:lang="pl"><![CDATA[https://www.amcs.uz.zgora.pl/?action=papers&issue=115]]></dc:source>
<dc:language><![CDATA[eng]]></dc:language>
<dc:relation><![CDATA[oai:zbc.uz.zgora.pl:publication:101094]]></dc:relation>
<dc:rights xml:lang="pl"><![CDATA[Biblioteka Uniwersytetu Zielonogórskiego]]></dc:rights>
</oai_dc:dc>

</metadata>
	  </record>	</GetRecord>
</OAI-PMH>
