The complexity of the matroid–greedoid partition problem

We show that the maximum matroid–greedoid partition problem is NP-hard to approximate to within 1 / 2 + ε for any ε > 0 , which matches the trivial factor 1/2 approximation algorithm. The main tool in our hardness of approximation result is an extractor code with polynomial rate, alphabet size an...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 410; H. 8; S. 859 - 866
Hauptverfasser:	Asodi, Vera, Umans, Christopher
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Elsevier B.V 01.03.2009 Elsevier
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Convex and discrete geometry Exact sciences and technology Extractor codes Fixed-parameter complexity Geometry Greedoid Mathematics Matroid Matroid partition problem Miscellaneous Sciences and techniques of general use Theoretical computing Greedoid Matroid partition problem Extractor codes Matroid Fixed-parameter complexity Alphabet Polynomial Partition Construction Approximation Computer theory Decoding Approximation algorithm Code Computational complexity Maximum Randomness Computer
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!