A Parameterized View on Matroid Optimization Problems

DOI10.1007/11786986_57zbMATH Open1223.05016OpenAlexW2785994893MaRDI QIDQ3613798

Dániel Marx

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11786986_57

zbMATH Keywords

combinatorial optimizationindependent setmatroidmatroid partitionNP-hard matroid problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (4)

Setup optimization problems with matroid structure ⋮ Shifted matroid optimization ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ A multiply constrained matroid optimization problem

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• A parameterized view on matroid optimization problems 👍 👎
• Geometric lower bounds for parametric matroid optimization 👍 👎
• Decomposable multi-parameter matroid optimization problems. 👍 👎
• A multiply constrained matroid optimization problem 👍 👎
• Matroid optimization with generalized constraints 👍 👎
• Matroids and Combinatorial Optimisation 👍 👎

This page was built for publication: A Parameterized View on Matroid Optimization Problems