A note on robust subsets of transversal matroids

DOI10.15807/jorsj.67.37MaRDI QIDQ6586976

Naoyuki Kamiyama

Publication date: 13 August 2024

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

zbMATH Keywords

discrete optimizationtransversal matroidkernelization

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
• Note on Independence Functions
• Parameterized Algorithms
• Matroids and the greedy algorithm
• Matroid-constrained vertex cover
• A note on max \(k\)-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation

This page was built for publication: A note on robust subsets of transversal matroids