The matroid intersection cover problem

DOI10.1016/j.orl.2020.11.003OpenAlexW3099430045MaRDI QIDQ2661583

Benjamin Moseley, Sungjin Im, Kirk R. Pruhs

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2020.11.003

zbMATH Keywords

approximationmatroidset covermatroid intersection

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

Rainbow and monochromatic circuits and cocircuits in binary matroids ⋮ List Coloring of Two Matroids through Reduction to Partition Matroids ⋮ On the impossibility of decomposing binary matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-coloring of 3-uniform hypergraphs
• Evolutionary algorithms and matroid optimization problems
• On the single-source unsplittable flow problem
• On the relations of various conjectures on Latin squares and straightening coefficients
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Almost optimal set covers in finite VC-dimension
• On scheduling coflows (extended abstract)
• The Design of Approximation Algorithms
• The intersection of a matroid and a simplicial complex
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Multicast Routing for Energy Minimization Using Speed Scaling
• Applications of approximation algorithms to cooperative games
• Analytical approach to parallel repetition
• PTAS for geometric hitting set problems via local search
• Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
• Select and permute: an improved online framework for scheduling to minimize weighted completion time

This page was built for publication: The matroid intersection cover problem