<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=51553"><dc:title>Demange, Marc; Paschos, Vangelis (F-PARIS9-LA): Improved approximations for weighted and unweighted graph problems. (English. English summary. - Theory Comput. Syst. 38 (2005), no. 6, 763--787.</dc:title><dc:creator>Vesel,	Aleksander	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>računalništvo</dc:subject><dc:subject>stopnja aproksimacije</dc:subject><dc:subject>problem maksimizacije</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>computer science</dc:subject><dc:subject>weighted hereditary induced-subgraph maximization problems</dc:subject><dc:subject/><dc:date>2006</dc:date><dc:date>2015-07-10 14:54:28</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51553</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>