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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 410; no. 44; pp. 4471 - 4479
Main Author:	Marx, Dániel
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Oxford Elsevier B.V 17.10.2009 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!