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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 410; číslo 44; s. 4471 - 4479
Hlavní autor:	Marx, Dániel
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Oxford Elsevier B.V 17.10.2009 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!