Exact and Approximation Algorithms for Weighted Matroid Intersection

DOI10.1137/1.9781611974331.CH32zbMath1410.68400OpenAlexW2789722863MaRDI QIDQ4575609

Naoyuki Kamiyama, Chien-Chung Huang, Naonori Kakimura

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch32

Mathematics Subject Classification ID

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

Related Items (6)

A Fast Approximation for Maximum Weight Matroid Intersection ⋮ Packing of arborescences with matroid constraints via matroid intersection ⋮ Unnamed Item ⋮ Making Bipartite Graphs DM-Irreducible ⋮ On the Complexity of Recovering Incidence Matrices ⋮ Unnamed Item

This page was built for publication: Exact and Approximation Algorithms for Weighted Matroid Intersection