Competitive Weighted Matching in Transversal Matroids

DOI10.1007/978-3-540-70575-8_33zbMath1153.05328OpenAlexW1601470474MaRDI QIDQ3521935

Nedialko B. Dimitrov, C. Greg Plaxton

Publication date: 28 August 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_33

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Near optimal algorithms for online weighted bipartite matching in adversary model ⋮ Matroid prophet inequalities and applications to multi-dimensional mechanism design ⋮ On variants of the matroid secretary problem ⋮ Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) ⋮ Unnamed Item

This page was built for publication: Competitive Weighted Matching in Transversal Matroids