A parameterized view on matroid optimization problems

Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid problems, such as 3-matroid intersection, are NP-hard. Here we investigate these problems from the parameterized complexity...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 410; H. 44; S. 4471 - 4479
1. Verfasser:	Marx, Dániel
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Oxford Elsevier B.V 17.10.2009 Elsevier
Schlagworte:	Applied sciences Calculus of variations and optimal control Combinatorial optmization Computer science; control theory; systems Convex and discrete geometry Exact sciences and technology Fixed-parameter tractability Geometry Mathematical analysis Mathematics Matroids Miscellaneous Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Sciences and techniques of general use Theoretical computing Matroids Fixed-parameter tractability Combinatorial optmization Intersection Polynomial Partition Computer theory Combinatorial problem Matroid Optimization method Combinatorial optimization Complexity Polynomial time Network Independent set
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!