Persistency and matroid intersection

dc.contributor.author	Μάγος, Δημήτριος	el
dc.contributor.author	Μούρτος, Ιωάννης	el
dc.contributor.author	Πιτσούλης, Λεωνίδας Σ.	el
dc.date.accessioned	2015-06-07T08:22:33Z
dc.date.available	2015-06-07T08:22:33Z
dc.date.issued	2015-06-07
dc.identifier.uri	http://hdl.handle.net/11400/15411
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://link.springer.com/journal/10287	en
dc.subject	Independence system
dc.subject	Matroid intersection
dc.subject	Persistency partition
dc.subject	Ανεξάρτητο σύστημα
dc.subject	Διασταύρωση Matroid
dc.subject	Διαμέρισμα Ανθεκτικότητας
dc.title	Persistency and matroid intersection	en
heal.type	journalArticle
heal.classification	Technology
heal.classification	Computer science
heal.classification	Τεχνολογία
heal.classification	Πληροφορική
heal.classificationURI	http://zbw.eu/stw/descriptor/10470-6
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.classificationURI	N/A-Τεχνολογία
heal.classificationURI	N/A-Πληροφορική
heal.identifier.secondary	DOI: 10.1007/s10287-007-0064-x
heal.language	en
heal.access	campus
heal.recordProvider	Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	2009
heal.bibliographicCitation	Magos, D., Mourtos, I. and Pitsoulis, L. (2009) Persistency and matroid intersection. "Computational Management Science", 6 (4), p. 435-445. Available from: http://link.springer.com/article/10.1007%2Fs10287-007-0064-x [Accessed: 07/06/2015].	en
heal.abstract	In this paper, we show that for any independence system, the problem of finding a persistency partition of the ground set and that of finding a maximum weight independent set are polynomially equivalent.	en
heal.publisher	Schultz, Rüdiger	en
heal.journalName	Computational Management Science	en
heal.journalType	peer-reviewed
heal.fullTextAvailability	true