Approximating Maximum Independent Sets in Uniform Hypergraphs

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hofmeister, Thomas	de
dc.contributor.author	Lefmann, Hanno	de
dc.date.accessioned	2004-12-07T08:19:25Z	-
dc.date.available	2004-12-07T08:19:25Z	-
dc.date.created	1998	de
dc.date.issued	1998-11-08	de
dc.identifier.uri	http://hdl.handle.net/2003/5335	-
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-15156	-
dc.format.extent	143978 bytes	-
dc.format.extent	163706 bytes	-
dc.format.mimetype	application/pdf	-
dc.format.mimetype	application/postscript	-
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 23	de
dc.subject.ddc	004	de
dc.title	Approximating Maximum Independent Sets in Uniform Hypergraphs	en
dc.type	Text	de
dc.type.publicationtype	report	-
dcterms.accessRights	open access	-
Appears in Collections:	Sonderforschungsbereich (SFB) 531

Files in This Item:

File	Description	Size	Format
CI2398_doc.ps		140.6 kB	Postscript	View/Open
ci2398_doc.pdf	DNB	159.87 kB	Adobe PDF	View/Open

This item is protected by original copyright

Show simple item record

This item is protected by original copyright rightsstatements.org