Computing a K-independent set of maximal weight on a partially ordered set: a research case history

dc.contributor.author	Berenguer, Xavier
dc.date.accessioned	2008-02-29T09:45:24Z
dc.date.available	2008-02-29T09:45:24Z
dc.date.issued	1981-03
dc.identifier.issn	0210-8054 (versió paper)
dc.identifier.uri	http://hdl.handle.net/2099/4406
dc.description.abstract	This is a tutorial paper presenting the research carried out on the Sperner-Erdös problem, that is the problem of computing a Maximal Weighted K-Independent Set on a Partially Ordered set. Results are shown in the same order as the research was made: analysis and solution to the Sperner [sub]problem (K=1) and generalisation of this result yielding a polynomial solution to the Sperner-Erdös problem.
dc.format.extent	p. 25-29
dc.language.iso	eng
dc.publisher	Universitat Politècnica de Barcelona. Centre de Càlcul
dc.relation.ispartof	Qüestiió. 1981, vol.5, núm.1
dc.rights	Attribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject.other	Operations research
dc.title	Computing a K-independent set of maximal weight on a partially ordered set: a research case history
dc.type	Article
dc.subject.lemac	Investigació operativa
dc.subject.ams	Classificació AMS::90 Operations research, mathematical programming::90B Operations research and management science
dc.rights.access	Open Access
local.ordre	5

UPCommons. Portal del coneixement obert de la UPC