Pages that link to "Item:Q2839182"

The following pages link to Matroid matching: the power of local search (Q2839182):

Displaying 22 items.

• On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
• On matroid parity and matching polytopes (Q777400) (← links)
• Weighted matching with pair restrictions (Q1749789) (← links)
• Matching, matroids, and extensions (Q1849530) (← links)
• Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
• Optimal matroid partitioning problems (Q2032344) (← links)
• Locally defined independence systems on graphs (Q2109105) (← links)
• Stochastic packing integer programs with few queries (Q2191766) (← links)
• Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint (Q2218645) (← links)
• Generalized matroid matching (Q2309561) (← links)
• A simple PTAS for weighted matroid matching on strongly base orderable matroids (Q2448875) (← links)
• Matroid matching with Dilworth truncation (Q2476281) (← links)
• A simple PTAS for weighted matroid matching on strongly base orderable matroids (Q2840687) (← links)
• A Local Computation Approximation Scheme to Maximum Matching (Q2851862) (← links)
• Matroid matching: the power of local search (Q2875164) (← links)
• (Q5090466) (← links)
• Weighted linear matroid parity (Q5136215) (← links)
• Optimal matroid partitioning problems (Q5136271) (← links)
• A Weighted Linear Matroid Parity Algorithm (Q5149751) (← links)
• Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
• Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
• FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)